A New Algorithm for Decoding Reed-Solomon Codes

  • Shuhong Gao
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 712)


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.


Fast Fourier Transform Finite Field Network Security Cyclic Code Error Magnitude 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York, 1968. (Revised edition, Laguna Hills: Aegean Park Press, 1984.)MATHGoogle Scholar
  2. [2]
    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
  3. [3]
    I. F. Blake, S. Gao, and R. C. Mullin, “Explicit factorization of x 2k + 1 over F p with prime p ≡ 3 (mod 4),” App. Alg. in Eng., Comm. and Comp. 4 (1993) 89–94.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    D. G. Cantor, “On arithmetical algorithms over finite fields,” J. of Combinatorial Theory A 56 (1989), 285–300.MathSciNetCrossRefGoogle Scholar
  5. [5]
    S. Gao, “Additive fast Fourier transforms over finite fields,” in preparation.Google Scholar
  6. [6]
    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
  7. [7]
    J. von zur Gathen and J. Gerhard, Modern Computer Algebra, Cambridge University Press, New York, 1999.MATHGoogle Scholar
  8. [8]
    D. Gorenstein and N. Zierler, “A class of error-correcting codes in pm symbols,” J. Soc. Indust. A ppl. Math. 9 (1961) 207–214.MathSciNetMATHCrossRefGoogle Scholar
  9. [9]
    J. L. Massey, “Shift-register synthesis and BCH decoding,” IEEE Trans. Information Theory IT-15 1969 122–127.MathSciNetMATHCrossRefGoogle Scholar
  10. [10]
    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
  11. [11]
    I. S. Reed and G. Solomon, “Polynomial codes over certain finite fields,” SIAM J. Appl. Math. 8 (1960) 300–304.MathSciNetMATHCrossRefGoogle Scholar
  12. [12]
    Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, “A method for solving key equation for decoding Goppa codes,” Information and Control 27 (1975), 87–99.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Shuhong Gao
    • 1
  1. 1.Department of Mathematical SciencesClemson UniversityClemsonUSA

Personalised recommendations