On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm
Author:
- 22 January 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 54 (2) , 517-530
Abstract
The iterative bit flipping algorithm is applied to the standard regular low-density parity-check (LDPC) code ensemble. In the past, it was shown, for a typical code in the ensemble with left degree at least five and block length sufficiently large, that this algorithm can correct a linear (in the block length) number of worst case errors. In this paper, this result is extended to the case where the left degree is at least four. For the case where the left degree is larger than four, an improvement, compared to existing results, of several orders of magnitude is obtained on the fraction of worst case errors that can be corrected. It is also shown how the results can be further improved when random errors produced by the channel (as opposed to worst case errors) are considered.Keywords
This publication has 15 references indexed in Scilit:
- Error-Correction Capability of Column-Weight-Three LDPC CodesIEEE Transactions on Information Theory, 2009
- Modern Coding Theory2008
- LP decoding corrects a constant fraction of errors2004
- Asymptotic Enumeration Methods for Analyzing LDPC CodesIEEE Transactions on Information Theory, 2004
- Upper bounds on the rate of LDPC codesIEEE Transactions on Information Theory, 2002
- Bounds on the performance of belief propagation decodingIEEE Transactions on Information Theory, 2002
- Expander graph arguments for message-passing algorithmsIEEE Transactions on Information Theory, 2001
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Expander codesIEEE Transactions on Information Theory, 1996
- Nondirect convergence radius and number of iterations of the Hopfield associative memoryIEEE Transactions on Information Theory, 1994