2015/11/04 by Idris Mercer, Mercer, Idris
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #graph theory and CDMA systems #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1511.05023
Schmidt proved in 2014 that if ε>0, almost all binary sequences of length n have peak sidelobe level between (√(2)-ε)√(nlog n) and (√(2)+ε)√(nlog 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(log n-(1-ε)loglog n)), and we provide a slightly better upper bound that holds for a positive proportion of binary sequences of length n.