Exact random coding exponents for erasure decoding

Research output: Contribution to journalArticlepeer-review

24 Scopus citations


Random coding of channel decoding with an erasure option is studied. By analyzing the large deviations behavior of the code ensemble, we obtain exact single-letter formulas for the error exponents in lieu of Forney's lower bounds. The analysis technique we use is based on an enhancement and specialization of tools for assessing the statistical properties of certain distance enumerators. We specialize our results to the setup of the binary symmetric channel case with uniform random coding distribution and derive an explicit expression for the error exponent which, unlike Forney's bounds, does not involve optimization over two parameters. We also establish the fact that for this setup, the difference between the exact error exponent corresponding to the probability of undetected decoding error and the exponent corresponding to the erasure event is equal to the threshold parameter. Numerical calculations indicate that for this setup, as well as for a Z-channel, Forney's bound coincides with the exact random coding exponent.

Original languageEnglish
Article number6034743
Pages (from-to)6444-6454
Number of pages11
JournalIEEE Transactions on Information Theory
Issue number10
StatePublished - Oct 2011


  • Distance enumerator
  • erasure
  • error exponent
  • list
  • random coding


Dive into the research topics of 'Exact random coding exponents for erasure decoding'. Together they form a unique fingerprint.

Cite this