LDPC Tanner Graph

A bipartite factor graph connecting variable nodes (codeword bits) to check nodes (parity constraints). Click a node to highlight its connections. Watch belief propagation messages flow.

Variable nodes (n) 10

Check nodes (m) 5

Variable nodes (n)

Check nodes (m)

Info bits k=n-m

0.50

Code rate R=k/n

Variable node (bit) Check node (parity) Active message

LDPC codes: Low-Density Parity-Check. Messages flow along edges; each node updates based on incoming messages. Turbo-like performance near Shannon limit.