Typical peak sidelobe level of binary sequences
Noga Alon, Simon N. Litsyn, Alexander Shpunt · IEEE Transactions on Information Theory · 2010
For a binary sequenceSn= {si:i=1,2,...,n} ∈ {±1}n,n> 1, the peak sidelobe level (PSL) is defined as M(Sn)=maxk=1,2,...,n-1|∑i=1n-kSiSi+k|. It is shown that the distribution ofM(Sn) is strongly concentrated, and asymptotically almost surely γ(Sn) = (M(Sn))/√(n In n) ∈ [1-o(1),√2]. Explicit bounds for the number of sequences outside this range are provided. This improves on the best earlier known result due to Moon and Moser that the typical γ(Sn) ∈ [o([1/(√(ln n))]),2], and settles to the affirmative the conjecture of Dmitriev and Jedwab on the growth rate of the typical peak sidelobe. Finally, it is shown that modulo some natural conjecture, the typical γ(Sn) equals√2.