ON A DECODING ALGORITHM BY SUPERPOSITION FOR BINARY CYCLIC CODES FOR CERTAIN BURST ERRORS

Cyclic codes are often used for the purpose of correcting burst errors in digital transmission and recording systems. Since the implementati ons of the encoding and syndrome calculations of these codes are simpl e, these codes have superior properties from a practical perspective. In this paper, an effective decoding method is given for certain burst errors (multiple solid-burst errors) that are contained within the de tected errors resulting from a binary cyclic ''predecoding'' process, where the precoding process for burst error correction is terminated a t the detection stage. Such burst errors can be expressed as random er rors by superimposing a copy of itself that has been cyclically shifte d by one bit. So, by performing random error decoding on a version of the received sequence that has been superimposed with a one-bit cyclic ally shifted copy of itself, burst errors can be accurately corrected. This decoding method completely preserves the correction capacity of the precede and is applicable to any binary cyclic code with a minimum distance of at least 5. The correctable multiple solid-burst errors d epend on the minimum distance of the code. Furthermore, by applying th is technique to interleaved random error-correction codes for the purp ose of correcting burst errors, it is shown that it is possible to ext end the length of correctable burst errors.