This question relates to cyclic codes utilizing the generator G(X) = X4 + X2 + 1.

(a) For the following two messages calculate the Frame Check Sequence. M1 = 00000001, and M2 = 100000.

(b) (6 pts) Draw the shift register circuit.

(c) If the degree of G(X) is n, and all error patterns are equally likely, what is the probability that a long burst error is not detected?

(a) For the following two messages calculate the Frame Check Sequence. M1 = 00000001, and M2 = 100000.

(b) (6 pts) Draw the shift register circuit.

(c) If the degree of G(X) is n, and all error patterns are equally likely, what is the probability that a long burst error is not detected?