Abstract
This paper studies the mismatched decoding problem for binary-input discrete memoryless channels. An example is provided for which an achievable rate based on superposition coding exceeds the LM rate (Hui, 1983; Csisz'ar-K\"orner, 1981), thus providing a counter-example to a previously reported converse result (Balakirsky, 1995). Both numerical evaluations and theoretical results are used in establishing this claim.
| Original language | American English |
|---|---|
| Publisher | Cornell University Library, arXiv.org |
| DOIs | |
| State | Published - 2015 |
Bibliographical note
Place of conference:USAFingerprint
Dive into the research topics of 'A counter-example to the mismatched decoding converse for binary-input discrete memoryless channels'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver