The peak sidelobe level of random binary sequences
Abstract
Let An=(a0,a1,…,an-1) be drawn uniformly at random from \-1,+1\n and define \[ M(An)=0<u<n\,|Σj=0n-u-1ajaj+u| n>1. \] It is proved that M(An)/n n converges in probability to 2. This settles a problem first studied by Moon and Moser in the 1960s and proves in the affirmative a recent conjecture due to Alon, Litsyn, and Shpunt. It is also shown that the expectation of M(An)/n n tends to 2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.