Error Correction Capability of Column-Weight-Three LDPC Codes: Part II

Abstract

The relation between the girth and the error correction capability of column-weight-three LDPC codes is investigated. Specifically, it is shown that the Gallager A algorithm can correct $g/2-1$ errors in $g/2$ iterations on a Tanner graph of girth $g\ge 10$.

7 pages, 7 figures, submitted to IEEE Transactions on Information Theory (July 2008)

Cited by in corpus (5)

• Instanton-based Techniques for Analysis and Reduction of Error Floors of LDPC Codes
• On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes
• Multilevel Decoders Surpassing Belief Propagation on the Binary Symmetric Channel
• LDPC Codes Which Can Correct Three Errors Under Iterative Decoding
• Two-Bit Message Passing Decoders for LDPC Codes Over the Binary Symmetric Channel