Performance analysis of linear codes under maximum likelihood decoding at low rates

Hideki Yagi, H. Vincent Poor

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

Abstract

Or a given linear code, a lower bound on the error exponent under maximum likelihood decoding is investigated at low rates. or a given linear code, a lower bound on the error exponent under maximum likelihood decoding is investigated at low rates. F In the analysis of the decoding error probability, it is important to characterize the error exponent, since it indicates how fast the probability of decoding error converges to zero asymptotically. Over a symmetric memoryless channel, an error exponent is derived for a given linear code. A sufficient condition for achieving the expurgated exponent, which is the best among known error exponents at low rates, is given. Over a general discrete memoryless channel, the same analysis shows the expected error exponent of an ensemble of coset codes generated by a given linear code.

Original languageEnglish (US)
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages1168-1172
Number of pages5
DOIs
StatePublished - Aug 23 2010
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: Jun 13 2010Jun 18 2010

Publication series

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

Other

Other2010 IEEE International Symposium on Information Theory, ISIT 2010
CountryUnited States
CityAustin, TX
Period6/13/106/18/10

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'Performance analysis of linear codes under maximum likelihood decoding at low rates'. Together they form a unique fingerprint.

  • Cite this

    Yagi, H., & Poor, H. V. (2010). Performance analysis of linear codes under maximum likelihood decoding at low rates. In 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings (pp. 1168-1172). [5513669] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2010.5513669