A New Algorithm for Decoding Reed-Solomon Codes
A new algorithm is developed for decoding Reed-Solomon codes. It uses fast Fourier transforms and computes the message symbols directly without explicitly finding error locations or error magnitudes. In the decoding radius (up to half of the minimum distance), the new method is easily adapted for error and erasure decoding. It can also detect all errors outside the decoding radius. Compared with the BerlekampMassey algorithm, discovered in the late 1960’s, the new method seems simpler and more natural yet it has a similar time complexity.
KeywordsFast Fourier Transform Finite Field Network Security Cyclic Code Error Magnitude
Unable to display preview. Download preview PDF.
- R.E. Blahut, “Decoding of cyclic codes and codes on curves,” in spivnHandbook of Coding Theory, Vol. II (Eds. V. S. Pless, W. C. Huffman and R. A. Brualdi), Elsevier, 1998, 1569–1633.Google Scholar
- S. Gao, “Additive fast Fourier transforms over finite fields,” in preparation.Google Scholar
- J. von zur Gathen and J. Gerhard, “Arithmetic and factorization of polynomials over 𝔽2,” in Proc. ISSAC’96, Zürich, Switzerland, 1996, ACM press, 1–9.Google Scholar
- M. B. Pursley, “Reed-Solomon codes in frequency-hop communications,” in Reed-Solomon Codes and Their Applications (Eds. S. B. Wicker and V. K. Bhargava), IEEE Press, 1994, 150–174.Google Scholar