Instanton-based techniques for analysis and reduction of error floors of LDPC codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
On the number of errors correctable with codes on graphs
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Iterative approximate linear programming decoding of LDPC codes with linear complexity
IEEE Transactions on Information Theory
On trapping sets and guaranteed error correction capability of LDPC codes and GLDPC codes
IEEE Transactions on Information Theory
Error correction capability of column-weight-three LDPC codes under the Gallager A algorithm-Part II
IEEE Transactions on Information Theory
| Hi-index | 755.02 |
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.