Sparse graph code: Difference between revisions

Revision as of 10:45, 19 February 2006

Revision as of 16:46, 23 February 2006

Line 2:

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|Shannon]] limit. The archetypal sparse-graph codes are [[Robert G. Gallager|Gallager's]] [[low-density parity-check code]]s.

== dsfgsdfghsdfgsdfgsd

fg

sdfg

sd

fgsdfg

== External links ==