Bounds on rates of LDPC codes for BEC with varying erasure rate

Ohad Barak; Uri Erez; David Burshtein

doi:10.1109/ISIT.2008.4595164

Bounds on rates of LDPC codes for BEC with varying erasure rate

Ohad Barak^*, Uri Erez, David Burshtein

^*Corresponding author for this work

School of Electrical Engineering

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

A binary erasure channel with erasure probability which can take one of two values is considered. Transmission is done by using a low density parity-check code under the requirement that completely successful decoding is possible when the channel is in its better state, while tolerating some predetermined residual erasure fraction when the channel is in its worse state. Upper bounds on the achievable design rate under iterative decoding are derived for this setting. These bounds are compared to rates obtained by practical code profiles. It is also observed that when exceeding the capacity of the erasure channel, the performance of such codes exhibits graceful degradation as measured by the residual erasure fraction.

Original language	English
Title of host publication	Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages	1133-1137
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2008.4595164
State	Published - 2008
Event	2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada Duration: 6 Jul 2008 → 11 Jul 2008

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8101

Conference

Conference	2008 IEEE International Symposium on Information Theory, ISIT 2008
Country/Territory	Canada
City	Toronto, ON
Period	6/07/08 → 11/07/08

Access to Document

10.1109/ISIT.2008.4595164

Cite this

@inproceedings{b8490d9a719e49caa46e7f59dd7569fd,

title = "Bounds on rates of LDPC codes for BEC with varying erasure rate",

abstract = "A binary erasure channel with erasure probability which can take one of two values is considered. Transmission is done by using a low density parity-check code under the requirement that completely successful decoding is possible when the channel is in its better state, while tolerating some predetermined residual erasure fraction when the channel is in its worse state. Upper bounds on the achievable design rate under iterative decoding are derived for this setting. These bounds are compared to rates obtained by practical code profiles. It is also observed that when exceeding the capacity of the erasure channel, the performance of such codes exhibits graceful degradation as measured by the residual erasure fraction.",

author = "Ohad Barak and Uri Erez and David Burshtein",

year = "2008",

doi = "10.1109/ISIT.2008.4595164",

language = "אנגלית",

isbn = "9781424422579",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1133--1137",

booktitle = "Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008",

note = "2008 IEEE International Symposium on Information Theory, ISIT 2008 ; Conference date: 06-07-2008 Through 11-07-2008",

}

Barak, O, Erez, U & Burshtein, D 2008, Bounds on rates of LDPC codes for BEC with varying erasure rate. in Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008., 4595164, IEEE International Symposium on Information Theory - Proceedings, pp. 1133-1137, 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, 6/07/08. https://doi.org/10.1109/ISIT.2008.4595164

Bounds on rates of LDPC codes for BEC with varying erasure rate. / Barak, Ohad; Erez, Uri ; Burshtein, David.
Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. 2008. p. 1133-1137 4595164 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Bounds on rates of LDPC codes for BEC with varying erasure rate

AU - Barak, Ohad

AU - Erez, Uri

AU - Burshtein, David

PY - 2008

Y1 - 2008

N2 - A binary erasure channel with erasure probability which can take one of two values is considered. Transmission is done by using a low density parity-check code under the requirement that completely successful decoding is possible when the channel is in its better state, while tolerating some predetermined residual erasure fraction when the channel is in its worse state. Upper bounds on the achievable design rate under iterative decoding are derived for this setting. These bounds are compared to rates obtained by practical code profiles. It is also observed that when exceeding the capacity of the erasure channel, the performance of such codes exhibits graceful degradation as measured by the residual erasure fraction.

AB - A binary erasure channel with erasure probability which can take one of two values is considered. Transmission is done by using a low density parity-check code under the requirement that completely successful decoding is possible when the channel is in its better state, while tolerating some predetermined residual erasure fraction when the channel is in its worse state. Upper bounds on the achievable design rate under iterative decoding are derived for this setting. These bounds are compared to rates obtained by practical code profiles. It is also observed that when exceeding the capacity of the erasure channel, the performance of such codes exhibits graceful degradation as measured by the residual erasure fraction.

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

U2 - 10.1109/ISIT.2008.4595164

DO - 10.1109/ISIT.2008.4595164

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:52349103023

SN - 9781424422579

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1133

EP - 1137

BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008

T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008

Y2 - 6 July 2008 through 11 July 2008

ER -

Bounds on rates of LDPC codes for BEC with varying erasure rate

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this