Metraipolis › archive › dc_11fbaad7bb0f

Comments on the recent improvements of the MRRW bounds — arXiv:2609.01860

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.01860
License (as archived)
CC0-1.0
Archived
2026-10-17T05:43:36.446Z
SHA-256 of the archived text
2d66c30bff973fdd4511b8e0bd2cfce699af4b9a55e5e1511864d71b1c7004a0
Stable URL of this page
https://metraipolis.com/documento/dc_11fbaad7bb0f

How to cite

Comments on the recent improvements of the MRRW bounds — arXiv:2609.01860 — arXiv (en), https://arxiv.org/abs/2609.01860 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_11fbaad7bb0f (Metraipolis archive dc_11fbaad7bb0f, sha256 2d66c30bff973fdd4511b8e0bd2cfce699af4b9a55e5e1511864d71b1c7004a0)
BibTeX
@misc{dc11fbaad7bb0f,
  title = {Comments on the recent improvements of the MRRW bounds — arXiv:2609.01860},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.01860},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_11fbaad7bb0f; sha256 2d66c30bff973fdd4511b8e0bd2cfce699af4b9a55e5e1511864d71b1c7004a0},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01860. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The asymptotic McEliece--Rodemich--Rumsey--Welch bound (1977) limits the largest attainable rate of binary codes as a function of the relative distance. After a nearly half-century hiatus, this result was recently improved in two concurrent works, by OpenAI and by O. Alrabiah and V. Guruswami. The two arguments look entirely different, a Delsarte certificate on the one hand, a classical-quantum channel and the pretty good measurement on the other, and they yield the same bound. The purpose of this note is to explain why: in both proofs, a subspace is attached to every codeword and moved with it, and the bound counts how many such subspaces fit in the ambient space, exactly in the first case and in the probabilistic sense of typicality in the second. We also present the OpenAI proof in the language and context of coding theory, as an extension of the spectral method in which the single vector attached to a codeword is replaced by a subspace.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-03 in math.CO).
Categorie arXiv: Information Theory (cs.IT) ; Combinatorics (math.CO); Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.01860 — 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-17T04:59:51.799Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).