The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is:
$11001001000$
$11001001011$
$11001010$
$110010010011$
CRC Calculation
https://www.geeksforgeeks.org/error-detection-in-computer-networks/
Answer - B. Degree of generator polynomial is $3$ hence $3-bits$ are appended before performing division After performing division using $2$'$s$ complement arithmetic remainder is $011$ The remainder is appended to original data bits and we get $M' = 11001001\bf{011}$ from $M = 11001001.$
Courtesy, Anurag Pandey
m + r + 1 < 2^{r}
messege, m = 8 bits
8 + 1 + 1 > 2^{1}
8 + 2 + 1 > 2^{2}
8 + 3 + 1 > 2^{3}
8 + 4 + 1 < 2^{4}
Hence r = 4
then sending mesg is 8 + 4 = 12 bits
ANS : d
Polynomial function is $x^{3}$ +1
It can be interpreted as 1$x^{3}$ + 0$x^{2}$ + 0$x^{1} + 1$$x^{0}$
Considering all the coefficients: 1001 is the required divisor.
@Sumaiya23 Since the degree of CRC polynomial is 3 that's why 3 bits are appended.