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

Fingerprint

Maximum likelihood
Decoding

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

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
Lee, Ki Moon ; Radha, Hayder ; Kim, Beom Jin ; Song, Hong-Yeop. / Kovalenko's full-rank limit and overheads as lower bounds of error-performances of LDPC and LT codes over Binary Erasure Channels. 2008 International Symposium on Information Theory and its Applications, ISITA2008. 2008. (2008 International Symposium on Information Theory and its Applications, ISITA2008).
@inproceedings{edf98ba069b444c1bef0878f29a70786,
title = "Kovalenko's full-rank limit and overheads as lower bounds of error-performances of LDPC and LT codes over Binary Erasure Channels",
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.",
author = "Lee, {Ki Moon} and Hayder Radha and Kim, {Beom Jin} and Hong-Yeop Song",
year = "2008",
month = "12",
day = "1",
doi = "10.1109/ISITA.2008.4895488",
language = "English",
isbn = "9781424420698",
series = "2008 International Symposium on Information Theory and its Applications, ISITA2008",
booktitle = "2008 International Symposium on Information Theory and its Applications, ISITA2008",

}

Lee, KM, Radha, H, Kim, BJ & 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, 2008 International Symposium on Information Theory and its Applications, ISITA2008, Auckland, New Zealand, 08/12/7. https://doi.org/10.1109/ISITA.2008.4895488

Kovalenko's full-rank limit and overheads as lower bounds of error-performances of LDPC and LT codes over Binary Erasure Channels. / Lee, Ki Moon; Radha, Hayder; Kim, Beom Jin; Song, Hong-Yeop.

2008 International Symposium on Information Theory and its Applications, ISITA2008. 2008. 4895488 (2008 International Symposium on Information Theory and its Applications, ISITA2008).

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

TY - GEN

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

AU - Lee, Ki Moon

AU - Radha, Hayder

AU - Kim, Beom Jin

AU - Song, Hong-Yeop

PY - 2008/12/1

Y1 - 2008/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77951130438&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951130438&partnerID=8YFLogxK

U2 - 10.1109/ISITA.2008.4895488

DO - 10.1109/ISITA.2008.4895488

M3 - Conference contribution

AN - SCOPUS:77951130438

SN - 9781424420698

T3 - 2008 International Symposium on Information Theory and its Applications, ISITA2008

BT - 2008 International Symposium on Information Theory and its Applications, ISITA2008

ER -

Lee KM, Radha H, Kim BJ, Song H-Y. 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. 2008. 4895488. (2008 International Symposium on Information Theory and its Applications, ISITA2008). https://doi.org/10.1109/ISITA.2008.4895488