Generalized minimum distance iterative decoding of Tanner codes

Abstract — 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]. Index Terms — Expander codes, Tanner codes, generalized minimum distance decoding. I