The Gateway to Computer Science Excellence
0 votes
56 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
in Computer Networks by Junior (851 points) | 56 views

1 Answer

0 votes

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.

 

by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,508 answers
195,522 comments
100,960 users