Finite fields
Chinese remainder theorem: applications in computing, coding, cryptography
Chinese remainder theorem: applications in computing, coding, cryptography
Difference Sets and Hyperovals
Designs, Codes and Cryptography
Shift Register Sequences
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Binary sequences with optimal autocorrelation
Theoretical Computer Science
Generalization of GMW sequences and No sequences
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On the linear complexity of Legendre sequences
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Autocorrelation values of generalized cyclotomic sequences of order two
IEEE Transactions on Information Theory
Several classes of binary sequences with three-level autocorrelation
IEEE Transactions on Information Theory
New construction for binary sequences of period pm-1 with optimal autocorrelation using (z+1)d+azd+b
IEEE Transactions on Information Theory
On the linear complexity of Hall's sextic residue sequences
IEEE Transactions on Information Theory
Almost difference sets and their sequences with optimal autocorrelation
IEEE Transactions on Information Theory
Theory and applications of q-ary interleaved sequences
IEEE Transactions on Information Theory
Linear Complexity of Generalized Cyclotomic Binary Sequences of Order 2
Finite Fields and Their Applications
New cyclic difference sets with Singer parameters
Finite Fields and Their Applications
| Hi-index | 754.84 |
Binary sequences with optimal autocorrelation are needed in many applications. Two constructions of binary sequences with optimal autocorrelation of period N ≡ O (mod 4) are investigated. The two constructions are powerful and generic in the sense that many classes of binary sequences with optimal autocorrelation could be obtained from binary sequences with ideal autocorrelation. General results on the minimal polynomials of these binary sequences are derived. Based on the results, both the linear complexities and the minimal polynomials are determined.