Question

To provide more reliability than a single parity bit can give, an errordetecting 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

Answer 1

Hamming distance is 2

Step-by-step explanation:

Even though the 1st partity can identify even number bits and the 2nd partity can find odd numbers bit. This coding method only can surelly identify all single errors, meaning that d is equal to 1. By consequence, the hamming distance is the summation of d plus 1 resulting in two.

Even though there are times when it is detected two errors, normally one even and onde odd, it is not possible to find all the two errors.