Abstract
In this paper, for a positive odd integer n, a new family of binary sequences with 2n + 1 sequences of length 2n − 1 taking three level nontrivial correlations − 1 and − 1±2(n + 1)/2 is presented, whose correlation distribution is the same as that of the well-known Gold sequences. This family may be considered as a new class of Gold-like sequences.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boztas, S., Kumar, P.V.: Binary sequences with Gold-like correlation but larger linear span. IEEE Trans. Inform. Theory 40, 532–537 (1994)
Fan, P.Z., Darnell, M.: Sequence Design for Communications Applications. John Wiley, Chichester (1996)
Gold, R.: Maximal recursive sequences with 3-valued recursive crosscorrelation functions. IEEE Trans. on Inform. Theory 14, 154–156 (1968)
Helleseth, T., Kumar, P.V.: Sequences with low correlation. In: Pless, V., Huffman, C. (eds.) Handbook of Coding Theory, Elsevier, Amsterdam, The Netherlands (1998)
Kim, S.H., No, J.S.: New families of binary sequences with low crosscorrelation property. IEEE Trans. Inform. Theory 49, 3059–3065 (2003)
Lidl, R., Niederreiter, H.: Finite Fields. In: Encyclopedia of Mathematics, vol. 20, Cambridge University Press, Cambridge (1983)
Sidelnikov, V.M.: On mutual correlation of sequences. Soviet Math. Dokl. 12, 197–201 (1971)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tang, X., Helleseth, T., Hu, L., Jiang, W. (2007). A New Family of Gold-Like Sequences. In: Golomb, S.W., Gong, G., Helleseth, T., Song, HY. (eds) Sequences, Subsequences, and Consequences. Lecture Notes in Computer Science, vol 4893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77404-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-77404-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77403-7
Online ISBN: 978-3-540-77404-4
eBook Packages: Computer ScienceComputer Science (R0)