CRC check code

topic

Assuming that the generator polynomial is , the CRC check code of G(X)=X4+X3+1the binary sequence is required10110011

answer

sending end

First, the polynomial is generated as: G(X)=X4+X3+1, rewritten as a binary bit string as 11001(there are several powers of X, and the corresponding bit to the power of 2 is 1)

Because the generated polynomial binary string is 5 digits, the check code is 4 digits (n-1), so 101100114 0s are added at the end to get the result 101100110000. Use "modulo 2 division" (actually XOR) to get the result

How to calculate quotient

余数以0开头，则商0，余数以1开头，则商1

Receiving end

So 10110011the data sent to the receiving end with the binary sequence plus the check code is:101100110100

101100110100After the receiving end receives it , it is divided 11001(removed by "modulo 2 division"). If the remainder is 0, there is no error, as follows: This is

the data received by the receiving end.