Hamming Codes
n
Definition:
(n,k) = (2
^{m}
–
1, 2
^{m}
–
1
–
m)
n
For Hamming codes
d
_{min}
= 3. Therefore, they
are capable of correcting any single error or
detecting any double error.