Question: 14. Consider a Cyclic Redundancy Check (CRC) code with generator polynomial: g(x) = x3 + x2 + 1. a. Presume the codeword length is 8.
14. Consider a Cyclic Redundancy Check (CRC) code with generator polynomial: g(x) = x3 + x2 + 1.
a. Presume the codeword length is 8. Give an example error vector of undetectable error burst of length 6 (L = 6).
b. Give an example error vector of a detectable 6-bit error (M = 6).
c. Provide an example error vector of an undetectable error that is both a 3-bit error and has an error burst of length 7 (M = 3 and L = 7).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
