Construct · 1 fields · 1 citations

Tanner graph: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Coding theory

bipartite graph linking code bits to parity checks, the representation on which iterative decoding of low-density parity-check and related codes runs.

In coding theory, Tanner graph refers to bipartite graph linking code bits to parity checks, the representation on which iterative decoding of low-density parity-check and related codes runs. This meaning comes from Tanner (1981) in IEEE Transactions on Information Theory.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Tanner graph sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

code3 fields · 6 citationsjingle · one word, three constructs information4 fields · 5 citationsjingle · one word, four constructs parity4 fields · 5 citationsjingle · one word, four constructs

References

Tanner, R. (1981). A recursive approach to low complexity codes. IEEE Transactions on Information Theory, 27(5), 533-547. https://doi.org/10.1109/tit.1981.1056404

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct