CRC Problem

[needhelp83]

Consider a message D, presented by the following polynomial

x19 +x17 + x16 +x13 +x12 + x11 + x9 + x5 + x2 + 1

Calculate the CRC code R for that message using a “generator-polynomial”

x7 + x5 + x4 + x3 + x2 + 1.

Represent in binary code the message to be sent (D and R).

Generate 3-bit burst error and show the checking procedure (10 points)

 

************************************************** *****************

D = 10110011101000100101

G = 10111101

 

Divide using XOR

 

Added 7 0's to D

 

101100111010001001010000000/10111101

 

Transmitted message = 10001100101010110101

R= 111001

 

Now I need to generate a 3-bit burst error and I assume that could be anywhere. How do I show the check procedure?

 

Any suggestions?