Revision as of 22:21, 24 March 2004 edit Reina riemann (talk \| contribs) 209 edits np complete ← Previous edit		Revision as of 22:22, 24 March 2004 edit undo Reina riemann (talk \| contribs) 209 edits link NP-complete Next edit →
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 polynomial time decoders. They were first designed by Gallager in 1962. See [[Sparse graph codes]]. {{msg:stub}}

Low-density parity-check code: Difference between revisions