KnowraError-correcting codeLinked fromLinked fromThe 45 pages that link to Error-correcting code, each with the reason it gives.All 45Broader topic 4Related 31Narrower topic 8Compared with 2Hamming distanceNarrower topic: Codewords are designed to remain far apart under Hamming distance.Sphere packingNarrower topic: Sphere-packing arguments establish limits on code size and correction capability.Parity bitNarrower topic: Parity bits are a simple error-detection code, not a correction method.RAIDNarrower topic: RAID parity is one use of redundancy for recovering missing data.Hamming codeNarrower topic: Hamming codes are an early, compact construction within this broader family.Gilbert–Varshamov boundNarrower topic: The bound describes how many codewords can exist at a given length and distance.Hamming boundNarrower topic: The Hamming bound limits the number of codewords such a set can contain.Reed–Solomon error correctionNarrower topic: Reed–Solomon correction is one specific form of error-correcting coding.