Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The peak sidelobe level of random binary sequences (1105.5178v2)

Published 26 May 2011 in math.CO, cs.IT, and math.IT

Abstract: Let $A_n=(a_0,a_1,\dots,a_{n-1})$ be drawn uniformly at random from ${-1,+1}n$ and define [ 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(A_n)/\sqrt{n\log n}$ converges in probability to $\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(A_n)/\sqrt{n\log n}$ tends to $\sqrt{2}$.

Citations (17)

Summary

We haven't generated a summary for this paper yet.