3,732 views
3 votes
3 votes

1 Answer

0 votes
0 votes

c1 c2 c3 c4 = (1 0 1 1) = 11 so the error are at the position of 11 bit .as more than 8 bit are there so we need atleast 4 parity from the formula   2^p >= m+p+1 where the m= no of message bit , p= #parity bit and 1 i have included in this for handling the case of no error.

as we got the 4 parity bit we get 2^4 = 16 (0-15)  combination but we need only 12 combination (0-11)  . Let me draw the table so that u will get better understanding.f

p4 p3 p2 p1
 check bit 1  check bit 2  check bit 3  check bit 4
0 0 0 0
0 0 0 1                   
0 0 1 0                   
0 0 1 1                    
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1

 

Here P4 bit is firstly arrived at the side of the receiver that why we have taken the parity p4 bit as check bit 1 .

And in every column the bit  1 is the indication that check bit will take care of that bit position on the actual message and here it is said that it for odd parity .

now here c1 will take care of 8 9 10 11 so what u all need to do is just try to see the how many number of  ones is available on that all position it should counted for odd number of times if the number of 1 present is even then we have to put 1 for check bit 1(c1) similarly try to find the for all .

U will endup with this c1 c2 c3 c4 = 1 0 1 1 = 11 so the error is happened at the bit position 11. 

Related questions

0 votes
0 votes
0 answers
1
Rahul_Rathod_ asked Jan 19, 2019
594 views
what is approach to solve this type of question?
2 votes
2 votes
2 answers
2
iarnav asked Nov 19, 2018
3,086 views
If the Hamming distance between a dataword and the corresponding codeword is three, there are _____ bits in error.A) 5 B) 4 C) 3 D) none of the above
1 votes
1 votes
1 answer
4
Markzuck asked Jan 9, 2019
1,556 views
someone please post detailed solution pic for this procedure- I am getting bits 1 and 2 as errorneous.