Aperiodic correlations and the merit factor of a class of binary sequences (Corresp.)
Tom Høholdt, Helge Elbrond Jensen, JØrn Justesen · IEEE Transactions on Information Theory · 1985
A class of binary sequences of lengthN = 2^{m}is considered, and it is shown that their aperiodic autocorrelations can be calculated recursively in a simple way. Based on this, the merit factor of the sequences is calculated and it is shown that the asymptotic value is3. Finally, it is proved that the magnitude of the maximal aperiodic autocorrelation is bounded byN^{0.9}.