# Testbook

142 views
Assume x, y and z are n bit binary numbers then which of the following inequalities hold about Hamming Distance between them?

A. HD(x,y)+HD(y,z)>=HD(x,z)

B. HD(x,y)+HD(y,z)<=HD(x,z)

C. HD(x,y) - HD(y,z)>=HD(x,z)

D. None of the above

A)

It is correct.

If y lies between x and z then H(x,y) + H(y,z) =H(x,z)

If y doesnt lie betwween x and z then H(x,y) + H(y,z) > H(x,z)

B)

It is wrong since we have proved A) is correct

C)

If x and y are equal then LHS will be negative. So it is also wrong

selected by
0
Thanks

## Related questions

1
1.7k views
A 12-bit Hamming code whose hexadecimal value is 0xE4F arrives at a receiver. What was the original value in hexadecimal? Assume that not more than 1 bit is in error.
The hamming distance between the octets of $\text{0xAA}$ and $\text{0x55}$ is 7 5 8 6
It is necessary to formulate the hamming code for four data bits $D _3, D _5, D _6 and D _7$ together with three parity bits $P _1, P _2 and P _3$ ... to include the double bit error detection in the code. Assume that error occurs in the bit $D _5 and P _2$. Show how the error is detected.