New families of binary sequences with optimal three-level autocorrelation

IEEE Transactions on Information Theory

Volumn 47, Issue 1, 2001, Pages 428-433

  Ding, Cunsheng ^a,b   Helleseth, Tor ^a,c   Martinsen, Halvard ^c  

^a IEEE   (Hong Kong)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c UNIVERSITY OF BERGEN   (Norway)

Author keywords

Almost difference sets; Optimal autocorrelation; Sequences

Indexed keywords

ALMOST DIFFERENCE SET; OPTIMAL THREE-LEVEL AUTOCORRELATION;

CORRELATION METHODS; FUNCTIONS; INFORMATION THEORY; OPTIMIZATION; POLYNOMIALS; SET THEORY; THEOREM PROVING;

BINARY SEQUENCES;

EID: 0035091967     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.904555     Document Type: Article

References (21)

1. On ideal autocorrelation sequences arising from hyperovals
2. Almost difference sets and reversible difference sets
3. Cyclotomy, higher congruences, and Waring's problem
4. Binary cyclotomic generators
5. Cryptographic counter generators
6. Several classes of binary sequences with three-level autocorrelation
7. Kasami power functions, permutation polynomials and cyclic difference sets
8. Cyclic Hadamard difference sets - Constructions and applications
9. Sequences with low correlation
10. Difference sets: Abelian
11. Existence of cyclic Hadamard difference sets and its relation to binary sequences with ideal autocorrelation
12. A class of binary sequences with optimal autocorrelation properties
13. d + b
14. d
15. n - 1 with ideal autocorrelation