2000 character limit reached
Error Correction Capability of Column-Weight-Three LDPC Codes: Part II
Published 23 Jul 2008 in cs.IT and math.IT | (0807.3582v1)
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 \geq 10$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
