edited by
11,568 views
34 votes
34 votes

A computer network uses polynomials over $GF(2)$ for error checking with $8$ bits as information bits and uses $x^{3}+x+1$ as the generator polynomial to generate the check bits. In this network, the message $01011011$ is transmitted as:

  1. $01011011010$
  2. $01011011011$
  3. $01011011101$
  4. $01011011100$
edited by

3 Answers

Best answer
49 votes
49 votes

The generator polynomial has degree $3.$ So, we append $3$ zeroes to the original message.

Correct Answer: $C$

edited by
11 votes
11 votes
here generator is 1011

Clearly on dividing the message by it we get 101 to be padded at end

and only option C contains that

so OPTION (C) is correct
edited by
Answer:

Related questions

39 votes
39 votes
12 answers
2