Metraipolis › archive › dc_ce8486d36cef
A New Upper Bound on the Binary Deletion Channel Capacity — arXiv:2609.13351
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.13351
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:34:22.682Z
- SHA-256 of the archived text
e547711a1bd77d8dd669ed9116e58f57e88e8d1bac5a081db7a4669f761e7ab8- Stable URL of this page
https://metraipolis.com/documento/dc_ce8486d36cef
How to cite
A New Upper Bound on the Binary Deletion Channel Capacity — arXiv:2609.13351 — arXiv (en), https://arxiv.org/abs/2609.13351 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ce8486d36cef (Metraipolis archive dc_ce8486d36cef, sha256 e547711a1bd77d8dd669ed9116e58f57e88e8d1bac5a081db7a4669f761e7ab8)
BibTeX
@misc{dcce8486d36cef,
title = {A New Upper Bound on the Binary Deletion Channel Capacity — arXiv:2609.13351},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.13351},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ce8486d36cef; sha256 e547711a1bd77d8dd669ed9116e58f57e88e8d1bac5a081db7a4669f761e7ab8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13351. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove that the capacity of the binary deletion channel satisfies $C(d)\le (1-d)/4$ for every $13/20\le d<1$. The proof describes the output from right to left, using a six-bit context to assign a description length. We bound the increase in expected description length minus output entropy when one input bit is added. A relative-entropy identity reduces this bound to finitely many linear inequalities. A potential on input windows of length 26 makes the inequalities telescope, giving a bound for every input word. Deletion composition extends the result from $d=13/20$ to all larger deletion probabilities. We also obtain finite-block bounds on mutual information and decoding error, with explicit $O(\log n/n)$ corrections. The finite certificate is checked using exact integer arithmetic, and the proof is formalized end to end in Lean. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.IT). Categorie arXiv: Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2609.13351 — 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-16T01:21:38.603Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).