Вероятность ошибки CRC при наличии пакетной случайной помехи
The article analyzes possibilities of errors in telecommunication protocols using packet data transmission. Probabilistic model of a prolonged-action additive interference is represented as a sequence of executions of independent interference blocks with definite length. The paper shows that in certain conditions concerning a polynomial of degree k, used for creation of CRC code, with block size s, probability of error occurrence α is close to 2-k and doesn’t depend on s if distortion probability P1 is significant. It is demonstrated that for low values of P1=δ/n, δ>0, CRC error probability depends on s. Authors make an example of an interference with s = k, where error probability α is higher than 2^(-k) value (δ2^(k-1))/k times, therefore α=δ/2k and CRC is not efficient.