This question associates to cyclic codes using generator G(X) = X4 + X2 + 1.
(a) For following two messages compute Frame Check Sequence. M1 = 00000001, and M2 = 100000.
(b) Skecth shift register circuit.
(c) If degree of G(X) is n, and all error patterns are equally likely, determine the probability that long burst error is not detected?