# self doubt

139 views
CRC can detect any odd number of errors.

CRC can detect all burst errors of less than the degree of the polynomial.

Please explain and if possible give proof

If talk about error detection method CRC and CS (Check Sum) both are not 100% reliable.

Let's come to the question,

1.  If  (data bit + error handling bit )  both are corrupted then the error is called Meaningful error and in this case, None can detect it.

Let's take there are n bits of data and k bits of CRC the possible number of data will be 2^n and CRC set will be 2^k. In real 2^k <<<< 2^n. There is many to one function between them.

2. According to the above explanation, CRC can detect all burst errors of less than the degree of the polynomial.

## Related questions

1
134 views
The goal of this lab exercise is to implement an error-detection mechanism using the standard CRC algorithm described in the text. Write two programs, generator and verifier. The generator program reads from standard input a line of ASCII text containing an n-bit message ... see that the message is correct, but by typing generator <file | alter arg | verifier you should get the error message.
1 vote
What is the remainder obtained by dividing $x^7 + x ^5 + 1$ by the generator polynomial $x^ 3 + 1?$