What is the distance of the following code :

00000, 010101, 000111, 011001, 11111

(a) 2

(b) 3

(c) 4

(d) 5

(Please answer with brief explanation)

I assume u r asking about hamming distance. All we need to do is xor every number , find the number of 1s in resultant number. That is hamming distance. No of bit changes in the final number obtained is hamming distance. But there is a catch in the string u given . That all the strings should be of equal length. In the last 11111. I prepended 0.

### Question stats

Question and answer is powered by AnsPress