Andrew S. Tanenbaum Edition 5th Exercise 3 Question 8 (Page No. 252)

Question

To provide more reliability than a single parity bit can give, an error-detecting coding
scheme uses one parity bit for checking all the odd-numbered bits and a second parity
bit for all the even-numbered bits. What is the Hamming distance of this code?

Comments

duplicate of https://gateoverflow.in/85928/hamming-code

---

Although the first parity bit can detect even-numbered bits and the second parity bit can detect odd-numbered bits, this coding scheme can only detect ALL single error for sure, that is, d=1.

Therefore, the Hamming distance is d+1=2.

Although it can sometimes detect 2 errors (one even-numbered, one odd-numbered),

it cannot detect all the 2 errors.(think about it ??  you will get answer)