Title :
On mismatched list decoding
Author :
Anelia Somekh-Baruch
Author_Institution :
Faculty of Engineering, Bar-Ilan University, Ramat-Gan, 52900, Israel
fDate :
6/1/2015 12:00:00 AM
Abstract :
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.
Keywords :
"Decoding","Measurement","Channel coding","Manganese","Channel capacity"
Conference_Titel :
Information Theory (ISIT), 2015 IEEE International Symposium on
Electronic_ISBN :
2157-8117
DOI :
10.1109/ISIT.2015.7282510