Abstract
In 1976, Helleseth conjectured that two binary m-sequences of length 2m− 1 can not have a three-valued crosscorrelation function when m is a power of 2. We show that this conjecture is true when −1 is a correlation value. In other words, if \({{\mathcal{C}}_{1,k}}\) is the cyclic code of length 2m− 1 with two zeros α, α k, where α is a primitive element of \({{\mathbb{F}}_{2^m}}\) and gcd(k, 2m − 1) = 1, then its dual \({{\mathcal{C}}_{1,k}^{\perp}}\) can not have three weights when m is a power of 2.
Similar content being viewed by others
References
Berndt B.C., Evans R.J., Williams K.S.: Gauss and Jacobi Sums. Wiley Interscience, New York (1998)
Calderbank A.R., McGuire G., Poonen B., Rubinstein M.: On a conjecture of Helleseth regarding pairs of binary m-Sequences. IEEE Trans. Inform. Theory 42(3), 988–990 (1996)
Charpin P.: Cyclic codes with few weights and Niho exponents. J. Comb. Theory A 108(2), 247–259 (2004)
Helleseth T.: Some results about the cross-correlation function between two maximal linear sequences. Discret. Math. 16(3), 209–232 (1976)
Milies C.P., Sehgal S.K.: An Introduction to Group Rings. Kluwer Academic Publishers, Dordrecht (2002)
McGuire G.: On certain 3-weight cyclic codes having symmetric weights and a conjecture of Helleseth. In: Helleseth T., Kumar P.V., Yang K. (eds.) Sequences and Their Applications—Proceedings of SETA01. Springer, London (2002).
Niho Y.: Multivalued cross-correlation functions between two maximal linear recursive sequences, Ph.D. dissertation, University of Southern California (1972).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by T. Helleseth.
Rights and permissions
About this article
Cite this article
Feng, T. On cyclic codes of length \({2^{2^r}-1}\) with two zeros whose dual codes have three weights. Des. Codes Cryptogr. 62, 253–258 (2012). https://doi.org/10.1007/s10623-011-9514-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-011-9514-0