Binary sequences with merit factor greater than 6.34

Authors:
P. Borwein;K. -K.S. Choi;J. Jedwab
Affiliations:
Dept. of Math., Simon Fraser Univ., Burnaby, BC, Canada;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2004

Citing 0
Cited 6

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
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
Advances in the merit factor problem for binary sequences

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	754.84

Visualization

Abstract

The maximum known asymptotic merit factor for binary sequences has been stuck at a value of 6 since the 1980s. Several authors have suggested that this value cannot be improved. In this paper, we construct an infinite family of binary sequences whose asymptotic merit factor we conjecture to be greater than 6.34. We present what we believe to be compelling evidence in support of this conjecture. The numerical experimentation that led to this construction is a significant part of the story.