Finite-length analysis of low-density parity-check codes on the binary erasure channel
Top Cited Papers
- 7 August 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 48 (6) , 1570-1579
- https://doi.org/10.1109/tit.2002.1003839
Abstract
In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expression for the exact average bit and block erasure probability for a given regular ensemble of LDPC codes when decoded iteratively. We also give expressions for upper bounds on the average bit and block erasure probability for regular LDPC ensembles and the standard random ensemble under maximum-likelihood (ML) decoding. Finally, we present what we consider to be the most important open problems in this area.Keywords
This publication has 11 references indexed in Scilit:
- Improved low-density parity-check codes using irregular graphs and belief propagationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Design of efficient erasure codes with differential evolutionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient encoding of low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Capacity-Achieving SequencesPublished by Springer Nature ,2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Analysis of low density codes and improved designs using irregular graphsPublished by Association for Computing Machinery (ACM) ,1998
- Practical loss-resilient codesPublished by Association for Computing Machinery (ACM) ,1997
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962