Tanner graph

Tanner graphs play a central role in the design and decoding of LDPC codes.

Tanner graphs were proposed by Michael Tanner[1] as a means to create larger error correcting codes from smaller ones using recursive techniques.

be the rate of the resulting linear code, let the degree of the digit nodes be

The coding algorithm for Tanner graphs is extremely efficient in practice, although it is not guaranteed to converge except for cycle-free graphs, which are known not to admit asymptotically good codes.

[2] Zemor's decoding algorithm, which is a recursive low-complexity approach to code construction, is based on Tanner graphs.