edited by
4,616 views

4 Answers

Best answer
9 votes
9 votes
By performing XOR between 2 valid codeword will give another valid codeword,the no of 1's in the valid codeword will indicate hamming distance(d).

0xAA=1010 1010

and 0x55=0101 0101

performing XOR between them we get Hamming distance(d)=no of 1's in (1111 1111)=8
selected by
5 votes
5 votes

OxAA = 1010 1010

Ox55  =  0101 0101

As all the 8 pairs are different , so minimum hamming distance is 8.

2 votes
2 votes

Anser is [c] 8

 the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different.


"I do not seek. I find."

edited by
0 votes
0 votes

PERFORM XOR OPERATION BETWEEN EACH BIT TO GET HAMMING DISTANCE

OXAA= 10101010

XOR

OX55=  01010101


ANS =   11111111

THEREFORE HAMMING DISTANCE=8

Answer:

Related questions

0 votes
0 votes
1 answer
2
amitlko asked Oct 29, 2016
539 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)...
2 votes
2 votes
1 answer
3
dd asked Sep 14, 2016
7,605 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.
0 votes
0 votes
1 answer
4
admin asked Jan 6
86 views
If a code is t-error correcting, the minimum Hamming distance is equal to :$2 t+1$$2 t$$2 t-1$$t-1$