A Survey of the Merit Factor Problem for Binary Sequences

A classical problem of digital sequence design, first studied in the 1950s but still not well understood, is to determine those binary sequences whose aperiodic autocorrelations are collectively small according to some suitable measure. The merit factor is an important such measure, and the problem of determining the best value of the merit factor of long binary sequences has resisted decades of attack by mathematicians and communications engineers. In equivalent guise, the determination of the best asymptotic merit factor is an unsolved problem in complex analysis proposed by Littlewood in the 1960s that until recently was studied along largely independent lines. The same problem is also studied in theoretical physics and theoretical chemistry as a notoriously difficult combinatorial optimisation problem. The best known value for the asymptotic merit factor has remained unchanged since 1988. However recent experimental and theoretical results strongly suggest a possible improvement....

• Type: Conference
• Year: 2004
• Where: SETA
• Authors: Jonathan Jedwab
• Keywords: Asymptotic Merit Factor, Binary Sequences, Mathematics, Merit Factor, SETA 2004