@article{6de22f1244eb4898aa4a47f7df39ec7d,
title = "Upper bound on error exponent of regular LDPC codes transmitted over the BEC",
abstract = "The error performance of the ensemble of typical low-definition parity-check (LDPC) codes transmitted over the binary erasure channel (BEC) is analyzed. In the past, lower bounds on the error exponents were derived. In this paper, a probabilistic upper bound on this error exponent is derived. This bound holds with some confidence level.",
keywords = "Binary erasure channel (BEC), Block codes, Error exponent, Expurgated ensemble, Iterative decoding, Low-density parity-check (LDPC) codes, Stopping sets",
author = "Idan Goldenberg and David Burshtein",
note = "Funding Information: Manuscript received January 13, 2008. Current version published May 20, 2009. This work was supported by the Israel Science Foundation under Grant 927/05. The material in this paper was presented at the 5th International Symposium on Turbo Codes and Related Topics, Lausanne, Switzerland, September 2008. The authors are with the School of Electrical Engineering, Tel-Aviv University, Tel-Aviv Ramat–Aviv 69978, Israel (e-mail: idang.tau.ac.il; burstyn@eng. tau.ac.il). Communicated by T. Richardson, Associate Editor for Coding Theory. Color version of Figure 3 in this paper is available online at http://ieeexplore. ieee.org. Digital Object Identifier 10.1109/TIT.2009.2018344",
year = "2009",
doi = "10.1109/TIT.2009.2018344",
language = "אנגלית",
volume = "55",
pages = "2674--2681",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",
}