Generalized minimum distance iterative decoding of Tanner codes

Saejoon Kim
2005 IEEE Communications Letters  
In this Letter, we present a linear-time decoding algorithm for Tanner codes that can correct errors up to close to half the minimum distance of the code. The algorithm is a simple generalization to the iterative decoding algorithm of expander codes proposed by Skachek and Roth [3].
doi:10.1109/lcomm.2005.1496600 fatcat:imlop3r4qfbfzcn7zogyhvgltm