LDPC Codes Which Can Correct Three Errors Under Iterative Decoding

Abstract

In this paper, we provide necessary and sufficient conditions for a column-weight-three LDPC code to correct three errors when decoded using Gallager A algorithm. We then provide a construction technique which results in a code satisfying the above conditions. We also provide numerical assessment of code performance via simulation results.

5 pages, 3 figures, submitted to IEEE Information Theory Workshop (ITW), 2008

References in corpus (2)

• Error Correction Capability of Column-Weight-Three LDPC Codes: Part II
• LDPC Codes Which Can Correct Three Errors Under Iterative Decoding

Cited by in corpus (5)

• Finite Alphabet Iterative Decoders, Part II: Improved Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity
• Instanton-based Techniques for Analysis and Reduction of Error Floors of LDPC 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