Metraipolis › archive › dc_b19f1ce161aa
Moments of crosscorrelation demerit factors of binary sequences — arXiv:2609.05771
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.05771
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:35:26.801Z
- SHA-256 of the archived text
c6a42ba82ca7d00562f2df1fa628a6b23fd5f0d34f21a2fa7c5b00d0a9e87939- Stable URL of this page
https://metraipolis.com/documento/dc_b19f1ce161aa
How to cite
Moments of crosscorrelation demerit factors of binary sequences — arXiv:2609.05771 — arXiv (en), https://arxiv.org/abs/2609.05771 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b19f1ce161aa (Metraipolis archive dc_b19f1ce161aa, sha256 c6a42ba82ca7d00562f2df1fa628a6b23fd5f0d34f21a2fa7c5b00d0a9e87939)
BibTeX
@misc{dcb19f1ce161aa,
title = {Moments of crosscorrelation demerit factors of binary sequences — arXiv:2609.05771},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.05771},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b19f1ce161aa; sha256 c6a42ba82ca7d00562f2df1fa628a6b23fd5f0d34f21a2fa7c5b00d0a9e87939},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05771. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Families of sequences with low mutual aperiodic crosscorrelation assist the design of systems for multi-user asynchronous communications and multiple-input multiple-output radar. The crosscorrelation demerit factor of a pair of sequences is the sum of the squared magnitudes of their crosscorrelation values at every shift when the sequences are normalized to unit Euclidean norm, and the merit factor is the reciprocal of the demerit factor. For each positive integer $\ell$, we endow the $2^{2 \ell}$ pairs of binary sequences of length $\ell$ with uniform probability measure and study the distribution of their crosscorrelation demerit factors. Sarwate showed that the mean value is always $1$ regardless of length $\ell$. We develop a method for finding an exact formula for the $p$th central moment (for any positive integer $p$) as a function of $\ell$. Formulae for the variance and third central moment ($p=2$ and $3$) are then obtained by hand calculations, while the fourth through sixth central moments are obtained by computer-assisted calculations. Our theory also shows that all the central moments must be strictly positive for $p\geq 2$ and $\ell \geq 3$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.PR).
Categorie arXiv: Information Theory (cs.IT) ; Discrete Mathematics (cs.DM); Signal Processing (eess.SP); Combinatorics (math.CO); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.05771 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:09:59.828Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).