Simplified erasure/list decoding

We consider the problem of erasure/list decoding using certain classes of simplified decoders. Specifically, we assume a class of erasure/list decoders, such that a codeword is in the list if its likelihood is larger than a threshold. This class of decoders both approximates the optimal decoder of Forney, and also includes the following simplified subclasses of decoding rules: The first is a function of the output vector only, but not the codebook (which is most suitable for high rates), and the second is a scaled version of the maximum likelihood decoder (which is most suitable for low rates). We provide singleletter expressions for the exact random coding exponents of any decoder in these classes, operating over a discrete memoryless channel. For each class of decoders, we find the optimal decoder within the class, in the sense that it maximizes the erasure/list exponent, under a given constraint on the error exponent. We establish the optimality of the simplified decoders of the first and second kind for low and high rates, respectively.

[1]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[2]  Neri Merhav,et al.  Minimax Universal Decoding With an Erasure Option , 2007, IEEE Transactions on Information Theory.

[3]  Shlomo Shamai,et al.  Performance Bounds for Erasure, List, and Decision Feedback Schemes With Linear Block Codes , 2010, IEEE Transactions on Information Theory.

[4]  Pierre Moulin.  A Neyman-Pearson approach to universal erasure and list decoding , 2008, 2008 IEEE International Symposium on Information Theory.

[5]  Neri Merhav,et al.  Statistical Physics and Information Theory , 2010, Found. Trends Commun. Inf. Theory.

[6]  Vincent Yan Fu Tan,et al.  Asymmetric Evaluations of Erasure and Undetected Error Probabilities , 2014, IEEE Transactions on Information Theory.

[7]  V.W.S. Chan,et al.  Principles of Digital Communication and Coding , 1979 .

[8]  Vincent Y. F. Tan,et al.  Second- and Higher-Order Asymptotics For Erasure and List Decoding , 2014, ArXiv.

[9]  N. Sloane,et al.  Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. I , 1993 .

[10]  Neri Merhav,et al.  Exact Random Coding Exponents for Erasure Decoding , 2011, IEEE Trans. Inf. Theory.

[11]  Emre Telatar,et al.  Exponential bounds for list size moments and error probability , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[12]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[13]  Neri Merhav.  Another look at expurgated bounds and their statistical-mechanical interpretation , 2013, ArXiv.

[14]  Neri Merhav,et al.  Exact Random Coding Exponents for Erasure Decoding , 2011, IEEE Transactions on Information Theory.

[15]  Takeshi Hashimoto,et al.  Composite Scheme LR + Th for Decoding with Erasures and Its Effective Equivalence to Forney's Rule , 1999, IEEE Trans. Inf. Theory.

[16]  Takeshi Hashimoto.  Nonparametric threshold decision rule, coverings, and some consequences , 2000, IEEE Trans. Inf. Theory.

[17]  Neri Merhav,et al.  List Decoding—Random Coding Exponents and Expurgated Exponents , 2013, IEEE Transactions on Information Theory.

[18]  Neri Merhav.  Erasure/List Exponents for Slepian–Wolf Decoding , 2014, IEEE Transactions on Information Theory.

[19]  Li Peng,et al.  Expurgated Random-Coding Ensembles: Exponents, Refinements, and Connections , 2013, IEEE Transactions on Information Theory.

[20]  Nadav Shulman,et al.  Communication over an unknown channel via common broadcasting , 2003 .

[21]  Neri Merhav,et al.  Erasure/List Random Coding Error Exponents Are Not Universally Achievable , 2016, IEEE Transactions on Information Theory.

[22]  G. David Forney,et al.  Exponential error bounds for erasure, list, and decision feedback schemes , 1968, IEEE Trans. Inf. Theory.

[23]  Takeshi Hashimoto,et al.  Performance of explicit error detection and threshold decision in decoding with erasures , 1997, IEEE Trans. Inf. Theory.