Universal decoding with an erasure option

Neri Merhav*, Meir Feder

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Motivated by applications of rateless coding, decision feedback, and automatic repeat request (ARQ), we study the problem of universal decoding for unknown channels in the presence of an erasure option. Specifically, we harness the competitive minimax methodology developed in earlier studies, in order to derive a universal version of Forney's classical erasure/list decoder, which in the erasure case, optimally trades off between the probability of erasure and the probability of undetected error. The proposed universal erasure decoder guarantees universal achievability of a certain fraction ξ of the optimum error exponents of these probabilities. A single-letter expression for ξ which depends solely on the coding rate and the Neyman-Pearson threshold, is provided. The example of the binary symmetric channel is studied in full detail, and some conclusions are drawn.

Original languageEnglish
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Number of pages5
StatePublished - 2007
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: 24 Jun 200729 Jun 2007

Publication series

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


Conference2007 IEEE International Symposium on Information Theory, ISIT 2007


Dive into the research topics of 'Universal decoding with an erasure option'. Together they form a unique fingerprint.

Cite this