• retagged by
5,768 views
4 4 votes

1 Answer

0 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. 

Position:
Show:

Related questions

0 0 votes
0 0 answers
854
854 views
aashish1406 asked Aug 17, 2023
854 views
in reciever side to detect err which one representation we should follow to know that in which bit error is present in hamming code?p1p2d1p4d2d3d4p8d5d6 d6d5p8d4d3d2p4d1p...
0 0 votes
0 0 answers
878
878 views
Rahul_Rathod_ asked Jan 19, 2019
878 views
what is approach to solve this type of question?
0 0 votes
1 1 answer
16.9k
16.9k views
Na462 asked Sep 3, 2018
16,898 views
Sixteen-bit messages are transmitted using a Hamming code. How many check bits are needed to ensure that the receiver can detect and correct single-bit errors? Show the b...
4 4 votes
2 answers 2 answers
10.8k
10.8k views
dd asked Sep 14, 2016
10,780 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.