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 :
- A.
01110
- B.
01011
- C.
10101
- D.
10110
Attempted by 213 students.
Sign up free to check your answer
Sign up freeLoading lesson…

