Determination of the merit factor of Legendre sequences
IEEE Transactions on Information Theory
Binary Sequences with Good Correlation Properties
AAECC-5 Proceedings of the 5th International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
A survey of the merit factor problem for binary sequences
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Binary sequences with merit factor greater than 6.34
IEEE Transactions on Information Theory
Binary sequences with merit factor 6.3
IEEE Transactions on Information Theory
Advances in the merit factor problem for binary sequences
Journal of Combinatorial Theory Series A
| Hi-index | 0.00 |
We consider the merit factor of binary sequences obtained by appending an initial fraction of an m-sequence to itself. We show that, for all sufficiently large n, there is some rotation of each m-sequence of length n that has merit factor greater than 3.34 under suitable appending. This is the first proof that the asymptotic merit factor of a binary sequence family can be increased under appending. We also conjecture, based on numerical evidence, that each rotation of an m-sequence has asymptotic merit factor greater than 3.34 under suitable appending. Our results indicate that the effect of appending on the merit factor is strikingly similar for m-sequences as for rotated Legendre sequences.