New upper bounds on error exponents

Simon Litsyn*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We derive new upper bounds on the error exponents for the maximum-likelihood decoding and error detecting in the binary symmetric channels. This is an improvement on the best earlier known bounds by Shannon-Gallager-Berlekamp (1967) and McEliece-Omura (1977). For the probability of undetected error the new bounds are better than the bounds by Levenshtein (1978, 1989) and the recent bound by Abdel-Ghaffar (1997). Moreover, we further extend the range of rates where the undetected error exponent is known to be exact. The new bounds are based on an analysis of possible distance distributions of codes along with some inequalities relating the distance distributions to the error probabilities.

Original languageEnglish
Pages (from-to)385-398
Number of pages14
JournalIEEE Transactions on Information Theory
Volume45
Issue number2
DOIs
StatePublished - 1999

Keywords

  • Distance distribution
  • Error exponents
  • Krawtchouk polynomials
  • Maximum-likelihood decoding
  • Undetected error

Fingerprint

Dive into the research topics of 'New upper bounds on error exponents'. Together they form a unique fingerprint.

Cite this