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 ≥ 10.
0