Cyclic redundancy check code CRC of the original packet is "11001010101", which generator polynomial is:. X ^ after subjected to the CRC coding result 4 ^ + x ^ 3 ^ + x + 1 is?

Cyclic redundancy check code (CRC error detection is not only an error correction check code)
he is actually calculated using modulo 2 division of I by the following example briefly use.

The original message is "11001010101", the generator polynomial is: the X- ⁴ + the X- ³ . After its CRC coding result + x + 1 is?
First you appreciated generating polynomial X ^{. 4} + X ^{. 3} meanings + x + 1, wherein the maximum number of bits representing a binary power, the highest power in the present embodiment is four binary number is generated has 5, x ⁴ represents the highest bit is 1, and so will be a string of binary code is 11011
achieve a so-called cyclic redundancy check code is divided by the original message of this binary code, but before then in addition, the need for the original message to be fill the seats, how to fill the seats it, this is also very good fill, fill-digit binary numbers generated by -1 to 0, so the message will become 110,010,101,010,000 (make up 4 0)
so this time we 110010101010000 11011 divided by two mold
here to remember, mold two different division ordinary division, the division is actually two mode data XORed.
What is it XOR: XOR operation means: the value of participating in two operations, if two corresponding bits of the same, the result is 0, 1 otherwise
so exclusive-or operation is the outcome: 0011