Hamming codes

views updated

Hamming codes A family of binary linear perfect error-correcting block codes. They are capable of correcting any single error occurring in the block. Considered as (n, k) block codes, Hamming codes have n = 2m – 1, k = nm

where m characterizes the particular code. Where multiple-error-correcting abilities are required, Hamming codes may be generalized into Bose-Chaudhuri-Hocquenghem (BCH) codes. The code was discovered by R. W. Hamming in 1950.