A computer network uses polynomial over GF(2) for error checking with 8 bits as information bits and uses x² + x + 1 as the generator polynomial to generate the check bits.
In this network, the message 10010011 is transmitted as
(A) 1001001100
(B) 1001001101
(C) 1001001111
(D) 1001001110


Answer: (D)

Explanation: Using CRC:

x2 + x + 1 is divisor i.e. 111 

So, We have to add n-1 0\’s at the end of the dividend (original message).

Now add the reminder in the original message:

1001001110  

So, option (D) is correct.

Quiz of this Question