Consider the following message M = 1010001101. The cyclic redundancy check…

Answer: 01110

1. Convert the generator polynomial x^5 + x^4 + x^2 + 1 to divisor bits: 110101 (degree 5).

2. Append five 0 bits to the message: 1010001101 → 101000110100000.

3. Perform binary long division (bitwise XOR subtraction) of the extended message by the divisor 110101. The remainder after completing the division is 01110.

4. Append this remainder to the original message to get the transmitted frame: 1010001101 01110 → 101000110101110.

5. Verification: dividing the transmitted frame 101000110101110 by 110101 yields a zero remainder, confirming the CRC is correct.