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

GATE · 2005 · IT

Consider the following message M = 1010001101. The cyclic redundancy check (CRC) for this message using the divisor polynomial x5 + x4 + x2 + 1 is :  

  1. A.

    01110

  2. B.

    01011

  3. C.

    10101

  4. D.

    10110

Attempted by 213 students.

Sign up free to check your answer

Sign up free

Explore the full course: Isro

Loading lesson…