Abstract
Binary sequences with small aperiodic correlations play an important role in many applications ranging from radar to modulation and testing of systems. In 1977, M. Golay introduced the merit factor as a measure of the goodness of the sequence and conjectured an upper bound for this. His conjecture is still open. In this paper we survey the known results on the Merit Factor problem and comment on the recent experimental results by R.A.Kristiansen and M. Parker and by P. Borwein,K.-K.S.Choi and J. Jedwab. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Høholdt, T. (2006). The merit factor problem for binary sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3857 LNCS, pp. 51–59). Springer Verlag. https://doi.org/10.1007/11617983_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
