arXiv (All)
open access
Diagnosing the Refuted Mismatched Decoding Converse for Binary-Input Channels
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 exi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Binary Deletion Channel Capacity to Within One Hundredth of a Bit#1014006
- Taxonomy of Coding Techniques for Efficient Network Communications#139258
- LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws#222575
- A Multiuser Channel Capacity Region#1123594
- Efficient utilization of various network coding techniques in different wireless scenarios#948346
Record · ID 1064653
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive