Revision as of 17:52, 23 July 2004 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits The article titled modulo is not mainly about modular arithmetic; fixing the link. ← Previous edit		Revision as of 18:20, 23 July 2004 edit undo Michael Hardy (talk \| contribs) Administrators 210,577 edits mNo edit summary Next edit →
Line 1: A '''low-density parity-check code''' or LDPC 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 [[Robert G. Gallager\|Gallager]] in 1962. See [[~~Sparse~~sparse graph ~~codes~~code]]. Below is a graph fragment of an example LDPC code using Forney's

Low-density parity-check code: Difference between revisions