Summary
We present a survey of the crosscorrelation between m-sequences and point out some of the most interesting and challenging remaining open problems in this area. Some families of nonbinary sequences with ideal two-level autocorrelation functions are constructed. Methods for designing sequences of even length with good autocorrelation properties using cyclotomy axe given. In particular, binary sequences of even length with optimal autocorrelation functions are presented.
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
Canteaut, A., Charpin, P., Dobbertin, H. (2000) Binary m-sequences with three-valued crosscorrelation: a proof of Welch’s conjecture. IEEE Trans. Inform. Theory, 46 4–8.
Cusick, T. W., Dobbertin, H. (1996) Some new three-valued crosscorrelation functions for binary m-sequences. IEEE Trans. Inform. Theory, 42 1238–1240.
Dillon, J. F. (1999) Multiplicative difference sets via additive characters. Designs, Codes and Cryptography, 17, 225–235.
Dillon JF, H Dobbertin, H. (2000) New cyclic difference sets with Singer parameters Preprint.
Ding C, Helleseth T, Martinsen H (2001) New classes of binary sequences with optimal three-valued autocorrelation IEEE Trans. Inform. Theory 47 428–433.
Ding, C., Helleseth, T., and Parker, M. G. (2000) Autocorrelation of cyclotomic sequences. Submitted for publication.
Dobbertin H, Helleseth T, Kumar PV, Martinsen H (2001) Ternary m-sequences with three-valued crosscorrelation function: Two new decimations. To appear in IEEE Trans. Inform. Theory.
Gold, R. (1968) Maximal recursive sequences with 3-valued recursive cross- correlation functions. IEEE Trans. Inform. Theory, 14 154–156.
Helleseth, T. (1976) Some results about the cross-correlation function between two maximal linear sequences. Discrete Math. 16 209–232.
Helleseth, T., Gong, G. (2001) New nonbinary sequences with ideal two-level autocorrelation function. Submitted for publication.
Helleseth, T., Kumar, P. V., Martinsen, H. (2001) A new family of ternary sequences with ideal autocorrelation function. Designs, Codes and Cryptography 23 157–166.
Hollmann, H.D.L., Xiang, Q. (1999) A proof of the Welch and Niho conjectures on crosscorrelation of binary m-sequences. Submitted to Finite Fields and Their Applications.
Lempel, A., Cohn, M., Eastman, W. (1977) A class of balanced binary sequences with optimal autocorrelation properties. IEEE Trans. Inform. Theory, 23 38–44.
Lin H.A. (1998) From cyclic Hadamard difference sets to perfectly balanced sequences. Ph.D. Thesis, University of Southern California, Los Angeles, USA.
Niho, Y. (1972) Multi-valued cross-correlation functions between two maximal linear recursive sequences. Ph.D. Thesis, University of Southern California, 1972.
No, J. S., Chung, H., Song, H. Y., Yang, K., Lee, J. D., Helleseth, T. (2001) New construction for binary sequences of period pm — 1 with optimal autocorrelation using (z + l)d + azd + b. IEEE Trans. Inform. Theory, 47 1638–1644.
No, J. S., Chung, H., and Yun, M.S., (1998) Binary pseudorandom sequences of period 2m - l with ideal autocorrelation generated by the polynomial zd+(z+l)d IEEE Trans. Inform. Theory, 44 1278–1282.
V. M. Sidelnikov, V. M. (1969) Some k-valued pseudo-random sequences ane nearly equidistant codes. Problem. Peredach. Inform., 5 16–22.
Trachtenberg, H. M. (1970) On the cross-correlation functions of maximal linear sequences. Ph. D. Thesis, University of Southern California, Los Angeles.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag London
About this paper
Cite this paper
Helleseth, T. (2002). On the Crosscorrelation of m-Sequences and Related Sequences with Ideal Autocorrelation. In: Helleseth, T., Kumar, P.V., Yang, K. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0673-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0673-9_3
Publisher Name: Springer, London
Print ISBN: 978-1-85233-529-8
Online ISBN: 978-1-4471-0673-9
eBook Packages: Springer Book Archive