GATE | Gate IT 2005 | Question 78
GATE | Gate IT 2005 | Question 78
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
Answer: (A)
Comments
Post a Comment