A Proof of the Welch and Niho Conjectures on Cross-Correlations of Binary m-Sequences

Binary m-sequences are widely applied in navigation, radar, and communication systems because of their nice autocorrelation and cross-correlation properties. In this paper, we consider the cross-correlation between a binary m-sequence of length 2m?1 and a decimation of that sequence by an integer t. We will be interested in the number of values attained by such cross-correlations. As is well known, this number equals the number of nonzero weights in the dual of the binary cyclic code C1,t of length 2m?1 with defining zeros ? and ?t, where ? is a primitive element in GF(2m). There are many pairs (m, t) for which C?1,t is known or conjectured to have only few nonzero weights. The three-weight examples include the following cases:We present a method of proving many of these known or conjectured results, including all of the above cases, in a unified way.

[1]  Vera Pless,et al.  Power Moment Identities on Weight Distributions in Error Correcting Codes , 1963, Inf. Control..

[2]  T. Kasami.  WEIGHT DISTRIBUTION OF BOSE-CHAUDHURI-HOCQUENGHEM CODES. , 1966 .

[3]  Robert Gold,et al.  Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.) , 1968, IEEE Trans. Inf. Theory.

[4]  R. McEliece.  On periodic sequences from GF(q) , 1971 .

[5]  Tadao Kasami,et al.  The Weight Enumerators for Several Clauses of Subcodes of the 2nd Order Binary Reed-Muller Codes , 1971, Inf. Control..

[6]  Yoji Niho.  Multi-Valued Cross-Correlation Functions between Two Maximal Linear Recursive Sequences , 1972 .

[7]  Tor Helleseth,et al.  Some results about the cross-correlation function between two maximal linear sequences , 1976, Discret. Math..

[8]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[9]  M.B. Pursley,et al.  Crosscorrelation properties of pseudorandom and related sequences , 1980, Proceedings of the IEEE.

[10]  Richard M. Wilson,et al.  On the minimum distance of cyclic codes , 1986, IEEE Trans. Inf. Theory.

[11]  Andries E. Brouwer,et al.  A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parameters , 1993, Des. Codes Cryptogr..

[12]  A. Robert Calderbank,et al.  Proof of a conjecture of Sarwate and Pursley regarding pairs of binary m-sequences , 1995, IEEE Trans. Inf. Theory.

[13]  A. Robert Calderbank,et al.  On a conjecture of Helleseth regarding pairs of binary m-sequences , 1996, IEEE Trans. Inf. Theory.

[14]  Hans Dobbertin,et al.  Some new three-valued crosscorrelation functions for binary m-sequences , 1996, IEEE Trans. Inf. Theory.

[15]  P. V. Kumar,et al.  On a sequence conjectured to have ideal 2-level autocorrelation function , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[16]  Claude Carlet,et al.  Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems , 1998, Des. Codes Cryptogr..

[17]  Hans Dobbertin,et al.  Almost Perfect Nonlinear Power Functions on GF(2n): The Niho Case , 1999, Inf. Comput..

[18]  Henk D. L. Hollmann,et al.  Gauss Sums, Jacobi Sums, and p-Ranks of Cyclic Difference Sets , 1999, J. Comb. Theory, Ser. A.

[19]  Hans Dobbertin,et al.  Almost Perfect Nonlinear Power Functions on GF(2n): The Welch Case , 1999, IEEE Trans. Inf. Theory.

[20]  Anne Canteaut,et al.  Binary m-sequences with three-valued crosscorrelation: A proof of Welch's conjecture , 2000, IEEE Trans. Inf. Theory.