Title :
A burst-error-correcting algorithm for Reed-Solomon codes
Author :
Chen, J. ; Owsley, P.
Author_Institution :
NASA Space Eng. Res. Center, Idaho Univ., Moscow, ID, USA
fDate :
11/1/1992 12:00:00 AM
Abstract :
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
Keywords :
Reed-Solomon codes; decoding; error correction codes; Reed-Solomon codes; Singleton bound; burst-error-correcting algorithm; decoding algorithm; miscorrection probability; Block codes; Decoding; Equations; Error correction; Error correction codes; Interleaved codes; Marine vehicles; Polynomials; Reed-Solomon codes; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
