LDPC Codes Which Can Correct Three Errors Under Iterative Decoding
Shashi Kiran Chilappagari, Anantha Raman Krishnan, Bane Vasic

TL;DR
This paper establishes conditions for column-weight-three LDPC codes to correct three errors with Gallager A decoding, introduces a construction method for such codes, and evaluates their performance through simulations.
Contribution
It provides necessary and sufficient conditions for error correction, a new construction technique, and performance assessment for specific LDPC codes.
Findings
Codes satisfying the conditions can correct three errors.
The proposed construction yields codes with guaranteed error correction.
Simulation results demonstrate the effectiveness of the codes.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
