Guaranteed error correction capability of codes on graphs
Shashi Kiran Chilappagari, Bane V. Vasic, Michael W. Marcellin · 2009
The guaranteed error correction capability of left regular LDPC codes under different hard decision decision algorithms is investigated. A summary of recent results relating the column weight and girth of the Tanner graph to the guaranteed error correction capability is provided. The intuition behind expander based arguments and their potential to derive new results for column-weight-three codes is provided.