Given polynomial is
G(x)=x5+x4+x2+1
Message from the destination node(T)=101000110101110
The Divisor polynomial bit =1×x5+1×x4+0×x3+1×x2+0×x+1×1
=110101
Bits to be appended to the message = (Divisor polynomial bits -1)=6−1=5
Now, append 5 zero to the message bit, hence=10100011010111000000
10100011010111000000/110101
Remainder =0000
Hence, CRC = 0000
Hence, we will not append any digit in the original message
So, the receiver will receive 101000110101110
Comments