a) Assume G = 100101, and M = 10110011. What check bits are sent by the sender?

a) Assume G = 100101, and M = 10110011. What check bits are sent by the sender?

b) Argue that if G has at least three terms (e.g. G = 1011 or G = 1110 or G = 1001100), then it can catch all errors E of the form x^i + x^(i-1) (i.e., two consecutive bits).