Low-density parity-check code: Difference between revisions

Revision as of 04:25, 3 March 2006

Revision as of 19:56, 3 March 2006

Line 6:

==Function==

LDPC uses a sparse [[parity-check matrix]].

This [[sparse matrix]] is randomly generated, subject to the [[sparsity]] constraints. These codes are among the state of the art codes (2004). Decoding them is an [[NP-complete]] problem, but there are good approximate decoders. These codes were first designed by [[Robert G. Gallager|Gallager]] in 1962.

See [[sparse graph code]].