On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
- 15 March 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 50 (3) , 439-454
- https://doi.org/10.1109/tit.2004.824918
Abstract
This paper investigates decoding of low-density parity-check (LDPC) codes over the binary erasure channel (BEC). We study the iterative and maximum-likelihood (ML) decoding of LDPC codes on this channel. We derive bounds on the ML decoding of LDPC codes on the BEC. We then present an improved decoding algorithm. The proposed algorithm has almost the same complexity as the standard iterative decoding. However, it has better performance. Simulations show that we can decrease the error rate by several orders of magnitude using the proposed algorithm. We also provide some graph-theoretic properties of different decoding algorithms of LDPC codes over the BEC which we think are useful to better understand the LDPC decoding methods, in particular, for finite-length codes.Keywords
This publication has 16 references indexed in Scilit:
- Asymptotic Enumeration Methods for Analyzing LDPC CodesIEEE Transactions on Information Theory, 2004
- Parity-check density versus performance of binary linear block codes over memoryless symmetric channelsIEEE Transactions on Information Theory, 2003
- Upper bounds on the rate of LDPC codesIEEE Transactions on Information Theory, 2002
- On ensembles of low-density parity-check codes: asymptotic distance distributionsIEEE Transactions on Information Theory, 2002
- Bounds on the maximum-likelihood decoding error probability 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
- Efficient erasure correcting codesIEEE Transactions on Information Theory, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981