Minimum-distance error-detection and correction guarantee
= Minimum-distance error-detection and correction guarantee
A code of minimum Hamming distance $d$ detects every pattern of at most $d-1$ errors and uniquely corrects every pattern of at most $\lfloor(d-1)/2\rfloor$ errors. The correction claim follows because Hamming balls of that radius around distinct codewords are disjoint.