Consider a system with the generator bitstream g =1011. We are interested in transmitting the data (or message) m =1001001.
(a) Write down the generator polynomial G(x).
(b) What is the order of the generator polynomial?
(c) Write down the message polynomial M(x).
(d) Perform the cyclic redundancy check (CRC) computation on the message and indicate the bitstream that is transmitted.
(e) Assume that the bitstream 1001001011 is received at the destination. Show why it should or should not be accepted as being error-free.
