Sparse graph code
|
|
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 Nyquist-Shannon limits. The archetypal sparse-graph codes are Gallager's low-density parity-check codes.
External links
- Encyclopedia of Sparse Graph Codes (http://www.inference.phy.cam.ac.uk/mackay/codes/data.html)