Low-density parity-check code

This is an old revision of this page, as edited by Reina riemann (talk | contribs) at 22:18, 24 March 2004 (state of the art). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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. It has polynomial time decoders. They were first designed by Gallager in 1962. See Sparse graph codes.