A burst-error-correcting algorithm for Reed-Solomon codes

It is known that for a burst-error environment, the error-correcting capability of Reed-Solomon codes can be extended beyond the Singleton bound with a high degree of confidence. This is significant in that an (n, k) code with an arbitrarily small probability of a miscorrection can correct more than (n-k)/2 errors. A decoding algorithm for correcting a burst of length greater than (n-k)/2 is presented.<
>