Kovalenko's full-rank limit and overheads as lower bounds of error-performances of LDPC and LT codes over Binary Erasure Channels

Ki Moon Lee, Hayder Radha, Beom Jin Kim, Hong Yeop Song

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

4 Citations (Scopus)

Abstract

We present Kovalenko's full-rank limit as a tight probabilistic lower bound for error performances of LDPC codes and LT codes over BEC. From the limit, we derive a full-rank overhead as a tight lower-bound for stable overheads for successful maximum-likelihood decoding of the codes.

Original languageEnglish
Title of host publication2008 International Symposium on Information Theory and its Applications, ISITA2008
DOIs
Publication statusPublished - 2008 Dec 1
Event2008 International Symposium on Information Theory and its Applications, ISITA2008 - Auckland, New Zealand
Duration: 2008 Dec 72008 Dec 10

Publication series

Name2008 International Symposium on Information Theory and its Applications, ISITA2008

Other

Other2008 International Symposium on Information Theory and its Applications, ISITA2008
CountryNew Zealand
CityAuckland
Period08/12/708/12/10

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Kovalenko's full-rank limit and overheads as lower bounds of error-performances of LDPC and LT codes over Binary Erasure Channels'. Together they form a unique fingerprint.

  • Cite this

    Lee, K. M., Radha, H., Kim, B. J., & Song, H. Y. (2008). Kovalenko's full-rank limit and overheads as lower bounds of error-performances of LDPC and LT codes over Binary Erasure Channels. In 2008 International Symposium on Information Theory and its Applications, ISITA2008 [4895488] (2008 International Symposium on Information Theory and its Applications, ISITA2008). https://doi.org/10.1109/ISITA.2008.4895488