Metraipolis › archive › dc_024717aecfeb
Binary code rate bounds via classical--quantum channels — arXiv:2608.09347
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.09347
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:09:14.764Z
- SHA-256 of the archived text
045e8d3f00e74c08d296b0caeed70b27b490cbdfaeced1d5513f37ffe4b64564- Stable URL of this page
https://metraipolis.com/documento/dc_024717aecfeb
How to cite
Binary code rate bounds via classical--quantum channels — arXiv:2608.09347 — arXiv (en), https://arxiv.org/abs/2608.09347 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_024717aecfeb (Metraipolis archive dc_024717aecfeb, sha256 045e8d3f00e74c08d296b0caeed70b27b490cbdfaeced1d5513f37ffe4b64564)
BibTeX
@misc{dc024717aecfeb,
title = {Binary code rate bounds via classical--quantum channels — arXiv:2608.09347},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.09347},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_024717aecfeb; sha256 045e8d3f00e74c08d296b0caeed70b27b490cbdfaeced1d5513f37ffe4b64564},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09347. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We derive the four principal asymptotic rate-distance tradeoffs for binary codes---Plotkin, Elias--Bassalygo, and the two McEliece--Rodemich--Rumsey--Welch (MRRW) bounds---from one theorem, the ``pretty good criterion.'' If the bit error rate under the pretty good measurement (PGM)---the quantum analog of posterior sampling---of a binary-input output-symmetric classical--quantum (cq) channel lies below $\delta$, then every length-$n$ binary code, linear or nonlinear, of relative distance $\delta$ has rate at most the channel's capacity, up to an $O(n^{-1/2})$ correction. Rate--distance bounds thereby reduce to a channel design problem, wherein the task is to minimize channel capacity subject to the posterior bit error rate constraint. Via the pretty good criterion, the binary erasure channel (BEC) yields Plotkin, the binary symmetric channel (BSC) yields Elias--Bassalygo, the pure-state channel (PSC) yields the first MRRW bound, and a masked PSC yields the second MRRW bound exactly. This framework is then instantiated with new channels to improve upon the MRRW bounds. Specifically, the mixed-qubit channel (MQC), a mixed-state version of PSC, strictly improves the first MRRW bound at every $0 < \delta < \frac{1}{2}$, while the masked mixed-qubit channel (2MQC) strictly improves the second MRRW bound throughout the same interval.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.CO).
Categorie arXiv: Information Theory (cs.IT) ; Combinatorics (math.CO); Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.09347 — 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-19T09:05:33.610Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).