Tanner graph

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 LDPC codes. They have also been applied to the construction of longer codes from smaller ones. Both encoders and decoders employ these graphs extensively.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.