Correlation functions of geometric sequences
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Binary sequences with optimal autocorrelation
Theoretical Computer Science
On a conjecture of Helleseth regarding pairs of binary m-sequences
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
Almost difference sets and their sequences with optimal autocorrelation
IEEE Transactions on Information Theory
Binary and quadriphase sequences with optimal autocorrelation properties: a survey
IEEE Transactions on Information Theory
Sets of Optimal Frequency-Hopping Sequences
IEEE Transactions on Information Theory
Proof of a conjecture of Sarwate and Pursley regarding pairs of binary m-sequences
IEEE Transactions on Information Theory
Hi-index | 754.84 |
Binary sequences with low correlation have applications in communication systems and cryptography. Though binary sequences with optimal autocorrelation were constructed in the literature, no pair of binary sequences with optimal autocorrelation are known to have also best possible cross correlation. In this paper, new bounds on the cross correlation of binary sequences with optimal autocorrelation are derived, and pairs of binary sequences having optimal autocorrelation and meeting some of these bounds are presented. These new bounds are better than the Sarwate bounds on the cross correlation of binary sequences with optimal autocorrelation.