Burst error correction using binary multiplication without carry

An innovative approach to error detection and correction is presented that permits accelerated performance with reduced computational complexity as compared to Reed - Solomon codes, while using the same number of bits for error control. The approach is based on the mathematical operation of binary multiplication without carry. The mathematical background of the proposed approach is first presented. The procedure for detecting transmission errors is then explained. This is followed by the development of the method for error correction. A numerical example for both procedures is given. Finally, an analytical comparison of the complexity of both the proposed and the Reed - Solomon methods is presented, that demonstrates the improvements attained.