Revision as of 18:21, 23 July 2004 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits mNo edit summary ← Previous edit		Revision as of 02:05, 26 July 2004 edit undo Dmeranda (talk \| contribs) Extended confirmed users 1,050 edits m Links to informatin theory and error correcting codes Next edit →
Line 1: AIn [[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. 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