Jump to content

Sparse graph code

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Reina riemann (talk | contribs) at 04:17, 22 March 2004 (graph definition of a code and initial definition of sparse graph code). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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 constrains that the transmitted bits have to satisfy. A Sparse graph code is a code where the graph that represents it is sparse. The state of the art classical error-correcting codes are based on sparse graphs.