Low-density parity-check code: Difference between revisions

Revision as of 23:03, 24 March 2004

Revision as of 02:27, 26 March 2004

Line 1:

A '''Low-density parity-check code''' is a code that 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. Decoding them is an [[NP-complete]] problem, but there are good approximate decoders. These codes were first designed by Gallager in 1962.

See [[Sparse graph codes]].

{{msg:stub}}