Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Autocorrelation and Linear Complexity of the New Generalized Cyclotomic Sequences
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Binary sequences with optimal autocorrelation
Theoretical Computer Science
Linear complexity of generalized cyclotomic binary sequences of length 2p m
Applicable Algebra in Engineering, Communication and Computing
Linear complexity and autocorrelation of prime cube sequences
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
About computation of the linear complexity of generalized cyclotomic sequences with period pn+1
Designs, Codes and Cryptography
On the linear complexity of Legendre sequences
IEEE Transactions on Information Theory
Shift-register synthesis and BCH decoding
IEEE Transactions on Information Theory
New Generalized Cyclotomy and Its Applications
Finite Fields and Their Applications
Hi-index | 0.00 |
In this article, new classes of generalized cyclotomic binary sequences with period 2p m are proposed. We determine the linear complexity and autocorrelation of these sequences. The results show that the proposed generalized cyclotomic binary sequences have high linear complexity, but do not have desirable autocorrelation properties.