The perfect binary sequence of period 4 for low periodic and aperiodic autocorrelations
SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
Appended m-sequences with merit factor greater than 3.34
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
The merit factor problem for binary sequences
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Synthesis of parallel binary machines
Proceedings of the International Conference on Computer-Aided Design
A survey of the merit factor problem for binary sequences
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Univariate and multivariate merit factors
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Hi-index | 754.84 |
A method is described for the construction of binary sequences of very long length and with asymptotic merit factor6.3. The result is backed up by strong experimental evidence although no formal proof for the asymptote is known. The sequences were found by Kristiansen using a small deterministic search, which we describe. Borwein, Choi, and Jedwab have independently identified a merit factor asymptote of 6.3421.... After we became aware of their work we realized that the sequences we construct are more simply described as periodic extensions of periodically rotated Legendre sequences.