Binary Sequences With Merit Factor $≫ 6.3$
R.A. Kristiansen, Matthew Geoffrey Parker · IEEE Transactions on Information Theory · 2004
A method is described for the construction of binary sequences of very long length and with asymptotic merit factor>6.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.