TY - JOUR
T1 - Bounds on achievable rates of LDPC codes used over the binary erasure channel
AU - Barak, Ohad
AU - Burshtein, David
AU - Feder, Meir
N1 - Funding Information:
Manuscript received July 15, 2002; revised June 24, 2004. This work was supported by the Israel Science Foundation under Grant 22/01-1. The authors are with the School of Electrical Engineering, Tel-Aviv University, Ramat-Aviv 69978, Tel-Aviv, Israel (e-mail: [email protected]; burstyn@ eng.tau.ac.il; [email protected]). Communicated by R. Urbanke, Associate Editor for Source Coding. Digital Object Identifier 10.1109/TIT.2004.834845
PY - 2004/10
Y1 - 2004/10
N2 - We derive upper bounds on the maximum achievable rate of low-density parity-check (LDPC) codes used over the binary erasure channel (BEC) under Gallager's decoding algorithm, given their right-degree distribution. We demonstrate the bounds on the ensemble of right-regular LDPC codes and compare them with an explicit left-degree distribution constructed from the given right degree.
AB - We derive upper bounds on the maximum achievable rate of low-density parity-check (LDPC) codes used over the binary erasure channel (BEC) under Gallager's decoding algorithm, given their right-degree distribution. We demonstrate the bounds on the ensemble of right-regular LDPC codes and compare them with an explicit left-degree distribution constructed from the given right degree.
UR - http://www.scopus.com/inward/record.url?scp=5144222246&partnerID=8YFLogxK
U2 - 10.1109/TIT.2004.834845
DO - 10.1109/TIT.2004.834845
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:5144222246
SN - 0018-9448
VL - 50
SP - 2483
EP - 2489
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 10
ER -