Error Correction Capability of Column-Weight-Three LDPC Codes: Part II
  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 \geq 10$. 
Shashi Kiran Chilappagari, Dung Viet Nguyen, Bane Vasic and Michael W.   Marcellin