A computer network uses polynomial over GF(2) for error checking with 8 bits as information bits and uses x3 + x + 1 as the generator polynomial to generate the check bits.
In this network, the message 01011011 is transmitted as
Explanation: We add (n-1) 0’s to the LSB of dividend(message) and divided by given GF
The remainder will be CRC, it will be added to the LSB of the original message, that should be transmitted to the receiver. That is: 01011011101.
This explanation is contributed by Mithlesh Upadhyay.
Quiz of this Question