Bounds on the growth rate of the peak sidelobe level of binary sequences

@article{Dmitriev2007BoundsOT,
  title={Bounds on the growth rate of the peak sidelobe level of binary sequences},
  author={Denis Dmitriev and Jonathan Jedwab},
  journal={Adv. in Math. of Comm.},
  year={2007},
  volume={1},
  pages={461-475}
}
The peak sidelobe level (PSL) of a binary sequence is the largest absolute value of all its nontrivial aperiodic autocorrelations. A classical problem of digital sequence design is to determine how slowly the PSL of a length n binary sequence can grow, as n becomes large. Moon and Moser showed in 1968 that the growth rate of the PSL of almost all length n binary sequences lies between order √ n log n and √ n, but since then no theoretical improvement to these bounds has been found. We present… CONTINUE READING