New families of binary sequences with optimal three-level autocorrelation

In this correspondence we give several new families of binary sequences of period N with optimal three-level autocorrelation, where N/spl equiv/2 (mod 4). These sequences are either balanced or almost balanced. Our construction is based on cyclotomy.

[1]  Paul H. Siegel,et al.  On codes that avoid specified differences , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[2]  Tor Helleseth,et al.  Balanced and Almost Balanced Binary Sequences of Period pm - 1 with Optimal Autocorrelation Using the Polynomial , 2000 .

[3]  Jong-Seon No,et al.  Binary Pseudorandom Sequences of Period 2m-1 with Ideal Autocorrelation Generated by the Polynomial zd + (z+1)d , 1998, IEEE Trans. Inf. Theory.

[4]  H. Dobbertin.  Kasami Power Functions, Permutation Polynomials and Cyclic Difference Sets , 1999 .

[5]  Guang Gong,et al.  On Ideal Autocorrelation Sequences Arising from Hyperovals , 1998, SETA.

[6]  E. C. Johnsen.  Special abelian group difference sets , 1968 .

[7]  Cunsheng Ding,et al.  Binary Cyclotomic Generators , 1994, FSE.

[8]  Jong-Seon No,et al.  Binary Pseudorandom Sequences of Period with Ideal Autocorrelation Generated by the Polynomial , 1998 .

[9]  David A. Cox.  Primes of the form x² + ny² : Fermat, class field theory, andcomplex multiplication , 1989 .

[10]  Laurence B. Milstein,et al.  Spread-Spectrum Communications , 1983 .

[11]  Abraham Lempel,et al.  A class of balanced binary sequences with optimal autocorrelation properties , 1977, IEEE Trans. Inf. Theory.

[12]  Cunsheng Ding,et al.  Several classes of binary sequences with three-level autocorrelation , 1999, IEEE Trans. Inf. Theory.

[13]  C. Ding.  Chinese remainder theorem , 1996 .

[14]  David A. Cox.  Primes of the Form x2 + ny2: Fermat, Class Field Theory, and Complex Multiplication , 1989 .

[15]  Tor Helleseth,et al.  New construction for binary sequences of period pm-1 with Optimal autocorrelation using (z+1)d+azd+b , 2001, IEEE Trans. Inf. Theory.

[16]  A. Salomaa,et al.  Chinese remainder theorem: applications in computing, coding, cryptography , 1996 .

[17]  James A. Davis.  Almost difference sets and reversible divisible difference sets , 1992 .

[18]  Leonard Eugene Dickson,et al.  Cyclotomy, Higher Congruences, and Waring's Problem II , 1935 .

[19]  C. Ding,et al.  Stream Ciphers and Number Theory , 1998 .

[20]  T. Helleseth,et al.  New Construction for Binary Sequences of Period with Optimal Autocorrelation Using , 2001 .

[21]  Solomon W. Golomb,et al.  Binary Pseudorandom Sequences of Period 2n-1 with Ideal Autocorrelation , 1998, IEEE Trans. Inf. Theory.

[22]  Solomon W. Golomb.  Cyclic Hadamard Difference Sets - Constructions and Applications , 1998, SETA.

[23]  Hong-Yeop Song,et al.  Existence of cyclic Hadamard difference sets and its relation to binary sequences with ideal autocorrelation , 1999, Journal of Communications and Networks.