Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Bit-Interleaved Coded Modulation
Foundations and Trends in Communications and Information Theory
On the outage capacity of a practical decoder accounting for channel estimation inaccuracies
IEEE Transactions on Communications
Optimization of information rate upper and lower bounds for channels with memory
IEEE Transactions on Information Theory
Multilevel coding for nonlinear ISI channels
IEEE Transactions on Information Theory
Bit-interleaved coded modulation revisited: a mismatched decoding perspective
IEEE Transactions on Information Theory
Design and analysis of successive decoding with finite levels for the Markov channel
IEEE Transactions on Information Theory
A lower bound for the capacity of the discrete-time Poisson channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Generalizing capacity: new definitions and capacity theorems for composite channels
IEEE Transactions on Information Theory
| Hi-index | 755.14 |
The mismatch capacity of a channel is the highest rate at which reliable communication is possible over the channel with a given (possibly suboptimal) decoding rule. This quantity has been studied extensively for single-letter decoding rules over discrete memoryless channels (DMCs). Here we extend the study to memoryless channels with general alphabets and to channels with memory with possibly non-single-letter decoding rules. We also study the wide-band limit, and, in particular, the mismatch capacity per unit cost, and the achievable rates on an additive-noise spread-spectrum system with single-letter decoding and binary signaling