Question: Consider a CRC code with a generator polynomial of g(x) = x4 + x + 1. a. Show step by step (using longhand division) how
Consider a CRC code with a generator polynomial of g(x) = x4 + x + 1.
a. Show step by step (using longhand division) how to find the codeword that corresponds to information bits of 10001.
b. Show the shift-register circuit that implements this CRC code.
c. Suppose the codeword length is 9.
i. What fraction of error bursts of length 7 is undetectable by this CRC code? Justify your answer.
ii. Give two examples of undetectable error bursts of length 7. Justify your answers.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
