KnowraLow-density parity-check codeLinked fromLinked fromThe 7 pages that link to Low-density parity-check code, each with the reason it gives.All 7Broader topic 3Related 2Compared with 2Error-correcting codeBroader topic: Its strong performance near channel capacity makes it useful in modern communications.Reed–Solomon codeCompared with: LDPC codes often suit iterative decoding of long noisy bit streams, unlike algebraic Reed–Solomon decoding.Coding theoryBroader topic: Sparse constraints enable iterative decoding with strong performance near channel limits.Regular graphRelated: Regular versions use uniform row and column weights in their associated bipartite graphs.Gilbert–Varshamov boundRelated: Sparse-graph code families are compared with the achievable rates predicted by the bound.Reed–Solomon error correctionCompared with: LDPC codes can approach channel-capacity limits, while Reed–Solomon codes excel at symbol bursts.Noisy-channel coding theoremBroader topic: These codes provide another practical route toward capacity-approaching reliability.