Metraipolis › archive › dc_e48dbd245d8e
Diagnosing the Refuted Mismatched Decoding Converse for Binary-Input Channels — arXiv:2609.28109
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.28109
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:12:02.991Z
- SHA-256 of the archived text
08b9271630954a7949d9aeb861bd89aae3bae7c77d440fa76151908307f35895- Stable URL of this page
https://metraipolis.com/documento/dc_e48dbd245d8e
How to cite
Diagnosing the Refuted Mismatched Decoding Converse for Binary-Input Channels — arXiv:2609.28109 — arXiv (en), https://arxiv.org/abs/2609.28109 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e48dbd245d8e (Metraipolis archive dc_e48dbd245d8e, sha256 08b9271630954a7949d9aeb861bd89aae3bae7c77d440fa76151908307f35895)
BibTeX
@misc{dce48dbd245d8e,
title = {Diagnosing the Refuted Mismatched Decoding Converse for Binary-Input Channels — arXiv:2609.28109},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.28109},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e48dbd245d8e; sha256 08b9271630954a7949d9aeb861bd89aae3bae7c77d440fa76151908307f35895},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.28109. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We revisit the claimed converse theorem for mismatched decoding over binary-input discrete memoryless channels (Balakirsky, 1995) and the subsequent work refuting this converse via a numerical counter-example (Scarlett, Somekh-Baruch, Martinez, and Guillén i Fàbregas, 2015). A notable gap in the existing understanding is that no concrete flaw was identified in Balakirsky's analysis. In this paper, Balakirsky's proof is "diagnosed", and it is demonstrated that (i) his permutation lemma is flawed regardless of the correctness of his combinatorial approximation lemma; (ii) there are at least two specific incorrect steps regarding restricted codes and selector sequences, and these appear to be unlikely to admit a local repair; and (iii) the proposition in which these incorrect steps are used is false in general. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-24 in math.IT). Categorie arXiv: Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2609.28109 — 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-08T12:10:03.937Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).