By the upper bound on burst error detection ( \ ell \ leqslant n-k = r ), we know that a cyclic code can not detect " all " bursts of length \ ell > r.
32.
The above proof suggests a simple algorithm for burst error detection / correction in cyclic codes : given a transmitted word ( i . e . a polynomial of degree \ leqslant n-1 ), compute the remainder of this word when divided by g ( x ).
