A Hamming code can correct all combinations of 𝑘 or fewer errors if and only if the minimum distance between any two code words is at least:
A. 𝑘 +1
B. 𝑘 −1
C. 2𝑘 +1
D. 2𝑘 −1
Answer:C
A Hamming code can correct all combinations of 𝑘 or fewer errors if and only if the minimum distance between any two code words is at least:
A. 𝑘 +1 B. 𝑘 −1 C. 2𝑘 +1 D. 2𝑘 −1