Hamming code: Difference between revisions

Revision as of 04:19, 14 January 2022

Revision as of 21:34, 15 January 2022

Line 16:

}}

In [[computer science]] and [[telecommunication]], '''Hamming codes''' are a family of [[linear code|linear error-correcting codes]]. Hamming codes can detect one-bit and two-bit errors, or correct one-bit errors without detection of uncorrected errors. By contrast, the simple [[parity bit|parity code]] cannot correct errors, and can detect only an odd number of bits in error. Hamming codes are [[perfect code]]s, that is, they achieve the highest possible [[Block code#The rate R|rate]] for codes with their [[block code#The block length n|block length]] and [[Block code#The distance d|minimum distance]] of three.<ref>{{cite web| url = [https://www.cs.cmu.edu/~venkatg/teaching/codingtheory/notes/notes1.pdf| title = See Lemma 12 of}}]</ref>

[[Richard Hamming|Richard W. Hamming]] invented Hamming codes in 1950 as a way of automatically correcting errors introduced by [[punched card]] readers. In his original paper, Hamming elaborated his general idea, but specifically focused on the [[Hamming(7,4)]] code which adds three parity bits to four bits of data.{{Sfnp|Hamming|1950|pp=153&ndash;154}}