Revision as of 02:27, 26 March 2004 edit Tagishsimon (talk \| contribs) Autopatrolled, Extended confirmed users, IP block exemptions, Pending changes reviewers 81,201 edits m format ← Previous edit		Revision as of 07:20, 26 March 2004 edit undo Stevenj (talk \| contribs) Extended confirmed users 14,849 edits m link 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 decoders. These codes were first designed by [[Robert G. Gallager\|Gallager]] in 1962. See [[Sparse graph codes]].

Low-density parity-check code: Difference between revisions