A neyman-pearson approach to universal erasure and list decoding

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We study communication over an unknown, possibly unreliable, discrete memoryless channel. For such problems, an erasure option at the decoder is desirable. We use constant-composition random codes and propose a generalization of the Maximum Mutual Information decoder. The proposed decoder is parameterized by a weighting function that can be designed to optimize the fundamental tradeoff between undetected-error and erasure exponents. Explicit solutions are identified. The class of functions can be further enlarged to optimize a similar tradeoff for list decoders. The optimal exponents admit simple expressions in terms of the sphere-packing exponent, at all rates below capacity. For small erasure exponents, these expressions coincide with those derived by Forney (1968) for symmetric channels, using Maximum a Posteriori decoding. Thus for those channels at least, ignorance of the channel law is inconsequential.

Original languageEnglish (US)
Title of host publicationProceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages61-65
Number of pages5
DOIs
StatePublished - Sep 29 2008
Event2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada
Duration: Jul 6 2008Jul 11 2008

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Other

Other2008 IEEE International Symposium on Information Theory, ISIT 2008
CountryCanada
CityToronto, ON
Period7/6/087/11/08

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A neyman-pearson approach to universal erasure and list decoding'. Together they form a unique fingerprint.

  • Cite this

    Moulin, P. (2008). A neyman-pearson approach to universal erasure and list decoding. In Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008 (pp. 61-65). [4594948] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2008.4594948