Hamming distance and error correction
Separated codewords permit bounded symbol-error recovery.
Key knowledge
Hamming distance counts differing coordinates of equal-length words. A binary block code with minimum distance 2t+1 can correct up to t bit substitutions by nearest-codeword decoding and detect up to 2t substitutions by codeword membership.
Conditions and scope
- t is a nonnegative integer and codewords have one fixed length.
- Detection and correction are different decoding tasks; insertions and deletions are excluded.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Hamming distance, block-code definitions and Theorem 16.13, odd minimum-distance correction/detection bound.
2026-10-10 · Odd-distance Theorem 16.13 and Hamming metric.
Entry details
Permanent link to this entry ↗- Record identity
- info-error-correcting-codes
- Revision
- university-reference.1
- Structured reference record
- University reference