Improved bounds on the peak sidelobe level of binary sequences

Original · EN

Schmidt proved in 2014 that if ε>0, almost all binary sequences of length n have peak sidelobe level between (√2-ε)√n n and (√2+ε)√n n. Because of the small gap between his upper and lower bounds, it is difficult to find improved upper bounds that hold for almost all binary sequences. In this note, we prove that if ε>0, then almost all binary sequences of length n have peak sidelobe level at most √2n(n-(1-ε) n), and we provide a slightly better upper bound that holds for a positive proportion of binary sequences of length n.