Metraipolis › archive › dc_2fda4faa6ba7
The Rate of the Delsarte Bound for Binary Codes and Spheres — arXiv:2610.21263
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.21263
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:33:27.732Z
- SHA-256 of the archived text
110a5b5409a02ff793c6149487e4d99d4d8ef43be47d2636cc60f276b60c4aff- Stable URL of this page
https://metraipolis.com/documento/dc_2fda4faa6ba7
How to cite
The Rate of the Delsarte Bound for Binary Codes and Spheres — arXiv:2610.21263 — arXiv (en), https://arxiv.org/abs/2610.21263 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2fda4faa6ba7 (Metraipolis archive dc_2fda4faa6ba7, sha256 110a5b5409a02ff793c6149487e4d99d4d8ef43be47d2636cc60f276b60c4aff)
BibTeX
@misc{dc2fda4faa6ba7,
title = {The Rate of the Delsarte Bound for Binary Codes and Spheres — arXiv:2610.21263},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.21263},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2fda4faa6ba7; sha256 110a5b5409a02ff793c6149487e4d99d4d8ef43be47d2636cc60f276b60c4aff},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21263. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We give the asymptotic rate of Delsarte's linear programming bound for binary codes and spherical codes. This extends previous work of the author which formulated and proved an analogue of the conjecture of Afkhami-Jeddi, Cohn, Hartman, de Laat, and Tajdini for binary codes, obtaining the rate of the Delsarte linear program at distance $1/2-1/\pi$. The lower bounds introduce ideas from potential theory into the study of Delsarte's bounds, whereby the measures underlying a system of orthogonal polynomials give an obstacle problem. We solve the resulting obstacle problem in the case of binary codes and spherical codes, obtaining a closed form for the lower bound in terms of elliptic integrals. For the upper bounds, we relate the $N$-qubit construction for binary codes used in previous work of the author to the constructions in OpenAI's Chapter 2 for spherical codes and observe that they both involve interlacing spectra. This leads to a variational problem involving measures constructed from these spectra under the Markov-Krein correspondence. This variational problem admits an exact solution and matches the lower bound. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO) ; Information Theory (cs.IT); Metric Geometry (math.MG). Pagina del lavoro: https://arxiv.org/abs/2610.21263 — 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-16T08:50:47.574Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).