@inproceedings{9194affb22844948a65da1881f6e26b0,
title = "Simplified erasure/list decoding",
abstract = "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.",
keywords = "Erasure/list decoding, decoding complexity, error exponents, mismatch decoding, random coding",
author = "Nir Weinberger and Neri Merhav",
note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; IEEE International Symposium on Information Theory, ISIT 2015 ; Conference date: 14-06-2015 Through 19-06-2015",
year = "2015",
month = sep,
day = "28",
doi = "https://doi.org/10.1109/ISIT.2015.7282851",
language = "الإنجليزيّة",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "2226--2230",
booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",
address = "الولايات المتّحدة",
}