Tanner graph
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In coding theory, a Tanner graph is a bipartite graph that can be used to express constraints (typically equations) that specify an error correcting code. Tanner graphs play a central role in the design and decoding of low-density parity-check codes. They have also been applied to the construction of longer codes from smaller ones. Both encoders and decoders employ these graphs extensively.
In coding theory, a Tanner graph is a bipartite graph that can be used to express constraints (typically equations) that specify an error correcting code. Tanner graphs play a central role in the design and decoding of low-density parity-check codes. They have also been applied to the construction of longer codes from smaller ones. Both encoders and decoders employ these graphs extensively. Let R be the rate of the resulting linear code, let the degree of the digit nodes be m and the degree of the subcode nodes be n . If each subcode node is associated with a linear code (n,k) with rate r = k/n, then the rate of the code is bounded by R \geq 1 - (1 - r)m \, Michael Tanner's Original paper Michael Tanner's page
Text derived from https://en.wikipedia.org/w/index.php?oldid=1296985959 under CC BY-SA 4.0; modifications have been made.