science

Tanner graph

Tanner graph is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Tanner graph rather than just read about it. In short: 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.

Key takeaways

Tanner graph belongs to science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Tanner graph to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Tanner graph from memory before moving on to harder problems.

Reference excerpt

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.

Origins Tanner graphs were proposed by Michael Tanner as a means to create larger error correcting codes from smaller ones using recursive techniques. He generalized the techniques of Peter Elias for product codes. Tanner discussed lower bounds on the codes obtained from these graphs irrespective of the specific characteristics of the codes which were being used to construct larger codes.

Use for linear block codes

Tanner graphs are partitioned into subcode nodes and digit nodes. For linear block codes, the subcode nodes denote rows of the parity-check matrix H. The digit nodes represent the columns of the matrix H. An edge connects a subcode node to a digit node if a nonzero entry exists in the intersection of the corresponding row and column.

Bounds proven by Tanner Tanner proved the following bounds Let R {\displaystyle R} be the rate of the resulting linear code, let the degree of the digit nodes be m {\displaystyle m} and the degree of the subcode nodes be n {\displaystyle 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 ≥ 1 − ( 1 − r ) m {\displaystyle R\geq 1-(1-r)m\,}

Computational complexity of Tanner graph based methods The advantage of these recursive techniques is that they are computationally tractable. 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.

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

Notes

Michael Tanner's Original paper Michael Tanner's page

Worked examples

Example 1 — a first encounter with Tanner graph

Start with the simplest possible case. Write down what Tanner graph claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Tanner graph before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Tanner graph ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Tanner graph

In research: Tanner graph appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Tanner graph in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Tanner graph is common in secondary-school and first-year university syllabi. It links to neighbouring topics Application-specific graphs, Coding theory, so understanding it makes those chapters shorter.
In everyday life: Look for Tanner graph outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Tanner graph in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Tanner graph means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Tanner graph out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Tanner graph in simple terms?

Why does Tanner graph matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Tanner graph?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Tanner graph.