A Survey of the Merit Factor Problem for Binary Sequences

@inproceedings{Jedwab2004ASO,
  title={A Survey of the Merit Factor Problem for Binary Sequences},
  author={Jonathan Jedwab},
  booktitle={SETA},
  year={2004}
}
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… CONTINUE READING