A Counter-Example to the Mismatched Decoding Converse for Binary-Input Discrete Memoryless Channels
Information Theory
2015-08-11 v1 math.IT
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.
Cite
@article{arxiv.1508.02374,
title = {A Counter-Example to the Mismatched Decoding Converse for Binary-Input Discrete Memoryless Channels},
author = {Jonathan Scarlett and Anelia Somekh-Baruch and Alfonso Martinez and Albert Guillén i Fàbregas},
journal= {arXiv preprint arXiv:1508.02374},
year = {2015}
}
Comments
Extended version of paper accepted to IEEE Transactions on Information Theory; rate derivation and numerical algorithms included in appendices