Jump to content

Tanner graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Netpilot43556 (talk | contribs) at 06:05, 5 August 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A Tanner graph is a bipartite Graph used to specify constraints or equations which specify Error correcting codes.

Origins

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

Computational complexity of Tanner graph based methods

The advantage of these recursive techniques is that they are computationally tractable.