A new algorithm for correcting single burst errors with Reed-Solomon codes

Abstract

The author presents a fast algorithm which can correct a single burst error length up to n-k-1 for a RS (n,k) code. Several methods which can reduce the probability of misdecoding if the length of the burst is longer than ((n-k)/2) are discussed. An RS (Reed-Solomon) decoder design is proposed which performs a regular error correction and the proposed burst error correction simultaneously. This method can also be used for BCH codes and for RS codes over Galois fields of characteristics other than two.<>