The peak sidelobe level of random binary sequences

preprint2014arXivOpen access

Abstract

Let An=(a0,a1,…,an−1)A_n=(a_0,a_1,\dots,a_{n-1}) be drawn uniformly at random from {−1,+1}n\{-1,+1\}^n and define M(An)=max⁡0<u<n ∣∑j=0n−u−1ajaj+u∣for n>1. M(A_n)=\max_{0<u<n}\,\Bigg|\sum_{j=0}^{n-u-1}a_ja_{j+u}\Bigg|\quad\text{for $n>1$}. It is proved that M(An)/nlog⁡nM(A_n)/\sqrt{n\log n} converges in probability to 2\sqrt{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)/nlog⁡nM(A_n)/\sqrt{n\log n} tends to 2\sqrt{2}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.