The setup of a general channel is considered in the mismatched case, i.e., when the decoder uses a general decoding metric. An expression for the average error probability in list decoding with block length n, metric qn, list size enΘn and rate R, denoted ϵ(n)qn(R, Θn), is established. Further, a general multi-letter formula for the mismatched capacity with list decoding is derived. It is shown that similarly to the matched capacity of the discrete memoryless channel, if the list size grows exponentially at a fixed rate Θ, then the increase in capacity is Θ bits per channel use. Additionally, a random coding lower bound on ϵ(n)qn(R, Θn) is presented. We conclude by presenting an inequality that can be regarded as an extension of Fano's inequality in the mismatched case with list decoding. As a special case, we derive a lower bound on the average probability of error at rates above the erasures only capacity of the discrete memoryless channel.
|Title of host publication||Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||5|
|State||Published - 28 Sep 2015|
|Event||IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong|
Duration: 14 Jun 2015 → 19 Jun 2015
|Name||IEEE International Symposium on Information Theory - Proceedings|
|Conference||IEEE International Symposium on Information Theory, ISIT 2015|
|Period||14/06/15 → 19/06/15|
Bibliographical notePublisher Copyright:
© 2015 IEEE.