edited by
33,733 views
27 votes
27 votes

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:

  1. $11001001000$

  2. $11001001011$

  3. $11001010$

  4. $110010010011$

edited by

4 Answers

Best answer
55 votes
55 votes

Answer - B.

Degree of generator polynomial is $3$ hence $3\text{-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

edited by
–5 votes
–5 votes
Answer is d the no. Of bits u add for n degree poly is n+ 1
–10 votes
–10 votes
ans a)
Answer:

Related questions

11 votes
11 votes
1 answer
2
64 votes
64 votes
15 answers
3
Arjun asked Jul 6, 2016
36,697 views
Consider the following segment of C-code:int j, n; j = 1; while (j <= n) j = j * 2;The number of comparisons made in the execution of the loop for any $n 0$ is:$\lceil \...