Revision as of 18:31, 6 September 2004 edit Charles Matthews (talk \| contribs) Autopatrolled, Administrators 367,893 edits m wfy ← Previous edit		Revision as of 18:32, 6 September 2004 edit undo Charles Matthews (talk \| contribs) Autopatrolled, Administrators 367,893 edits m fmt Next edit →
Line 1: In [[information theory]], a '''low-density parity-check code (LDPC code)''' is a [[error correcting code\|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 (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]].

Low-density parity-check code: Difference between revisions