Hamming codes
h■w to ov■rco■e n■ise
Hamming codes are a family of linear error-correcting codes. Hamming codes can detect up to two-bit errors or correct one-bit errors without detection of uncorrected errors. By contrast, the simple parity code cannot correct errors, and can detect only an odd number of bits in error. Hamming codes are perfect codes, that is, they achieve the highest possible rate for codes with their block length and minimum distance of three. - wikipedia
Written on September 10, 2020, Last update on December 11, 2022
hamming
distance
algorithm
hash
crc
3blue1brown
random