Note:
That there is no error if TR / P at the receiver has no remainder

Example :

Generate the BCS
Message ( X ) = X 9 + X 7 + X 3 + X 2 + 1

Pattern ( X ) = X 5 + X 4 + X 2 +1

1. From the Pattern we can say that n= 5
        M( x) = X 5 [X 9 + X 7 + X 3 + X 2 + 1]
        [X n M( x)] = M( x ) = X 14 + X12 + X 8 +X 7 + X 6
2. Convert the result into its binary form
        M (x ) = 101000111000000
        P(X) = 110101

3. [ X n M( x)] / P ( x) = M (x ) /P ( x) :

 

Previous