A Tanner graph is a type of bipartite graph that is used to represent error-correcting codes, particularly low-density parity-check (LDPC) codes. Named after Michael Tanner, who introduced this representation in the 1980s, Tanner graphs provide a visual and mathematical way to describe the relationships between code symbols (variables) and parity-check constraints (checks) in coding theory.

Articles by others on the same topic (0)

There are currently no matching articles.