A note on burst-error correction using the check polynomial (Corresp.)
D. Lewis, Masakazu Fukada · IEEE Transactions on Information Theory · 1973
When decoding a cyclic code, an alternative to computing the syndrome by dividing the receivedn-tupleW(x)by the generator polynomialG(x)is to compute the productH(x)W(x), modx^n - 1, with the check polynomialH(x). It is shown in this paper that the form of the product can be predicted in terms of general code parameters and corresponds closely to the burst error from which it is derived. By using the properties of the product sequence, a burst-error decoder is derived in such a way that a family of potentially fast burst-error decoders can be constructed. Another important application of the proposed technique concerns decoder implementation for the correction of a synchronization error (slip) when the coset code technique is used. It is shown that slip correction can be implemented so that both the magnitude and direction of slip are determined by examining only one receivedn-tuple.