Sparse graph code

From BitcoinWiki
This is the approved revision of this page, as well as being the most recent.
Jump to: navigation, search

A Sparse graph code is a code which is represented by a sparse graph. Any linear code can be represented as a graph, where there are two sets of nodes - a set representing the transmitted bits and another set representing the constraints that the transmitted bits have to satisfy. The state of the art classical error-correcting codes are based on sparse graphs, achieving close to the Shannon limit. The archetypal sparse-graph codes are Gallager's low-density parity-check codes.

External links[edit]

Source[edit]

http://wikipedia.org/

See Also on BitcoinWiki[edit]