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 Csiszár-Körner-Hui rate, thus providing a counter-example to a previously reported converse result. Both numerical evaluations and theoretical results are used in establishing this claim.
Original language | English |
---|---|
Article number | 7202893 |
Pages (from-to) | 5387-5395 |
Number of pages | 9 |
Journal | IEEE Transactions on Information Theory |
Volume | 61 |
Issue number | 10 |
DOIs | |
State | Published - 1 Oct 2015 |
Keywords
- Mismatched decoding
- binary-input channels
- channel capacity
- converse bounds
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences