Editing 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 [[bit]]s and another set representing the constraints that the transmitted bits have to satisfy. The state of the art classical [[error-correcting code]]s are based on sparse graphs, achieving close to the [[Shannon limit]]. The archetypal sparse-graph codes are [[Robert G. Gallager|Gallager's]] [[low-density parity-check code]]s.

== External links ==
* [http://www.inference.phy.cam.ac.uk/mackay/itila/ The on-line textbook: Information Theory, Inference, and Learning Algorithms], by [[David J.C. MacKay]], discusses sparse-graph codes in Chapters 47–50.
*[http://www.inference.phy.cam.ac.uk/mackay/codes/data.html Encyclopedia of Sparse Graph Codes]
* [http://www.cambridge.org/gb/knowledge/isbn/item2711886/?site_locale=en_GB Iterative Error Correction: Turbo, Low-Density Parity-Check, and Repeat-Cccumulate Codes]

[[Category:Matrix theory]]
[[Category:Error detection and correction]]


{{matrix-stub}}