A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 41 (6) , 1889-1902
- https://doi.org/10.1109/18.476314
Abstract
An upper bound on the maximal transmission rate over binary-input memoryless channels, provided that the decoding decision rule is given, is derived. If the decision rule is equivalent to the maximum-likelihood decoding (matched decoding), then the bound coincides with the channel capacity. Otherwise (mismatched decoding), it coincides with a known lower boundKeywords
This publication has 5 references indexed in Scilit:
- Mismatched decoding and the multiple access channelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Generalized cutoff rates and Renyi's information measuresIEEE Transactions on Information Theory, 1995
- On information rates for mismatched decodersIEEE Transactions on Information Theory, 1994
- Graph decomposition: A new key to coding theoremsIEEE Transactions on Information Theory, 1981
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948