A Decoding Approach to Reed–Solomon Codes from Their Definition

References

• Berlekamp, E. R. (1968). Algebraic Coding Theory. New York: McGraw-Hill Book Co.
   Google Scholar
• Berlekamp, E. R. (1980). The technology of error-correcting codes. Proceedings of the IEEE. 68: 564–593.
   Web of Science ®Google Scholar
• Berlekamp, E. R. (1982). Bit-serial Reed-Solomon encoders. IEEE Trans. Inform. Theory. IT 28: 869–874.
   Google Scholar
• Berlekamp, E. R. (1996). Bounded distance+1 soft-decision reed-solomon decoding. IEEE Trans. Inform. Theory. IT 42: 704–720.
   Google Scholar
• Bierbrauer, J. (2005). Introduction to Coding Theory. Boca Raton, FL: Chapman & Hall/CRC.
   Google Scholar
• Bossert, M., Bezzateev, S. (2013). A unified view on known algebraic decoding algorithms and new decoding concepts. IEEE Trans. Inform. Theory. 59: 7320–7336.
   Google Scholar
• Chambers, W. G. (1993). Solution of Welch-Berlekamp key equation by Euclidean algorithm. Electron. Lett. 29: 1031.
   Google Scholar
• Dornstetter, J.-L. (1987). On the equivalence between Berlekamp's and Euclid's algorithms. IEEE Trans. Inform. Theory. 33: 428–431.
   Google Scholar
• Fedorenko, S. V. (2005). A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm. IEEE Trans. Inform. Theory. 51: 1196–1198.
   Google Scholar
• Gorenstein, D., Zierler, N. (1961). A class of error-correcting codes in pm symbols. J. Soc. Indust. Appl. Math. 9: 207–214.
   Google Scholar
• Guruswami, V., Sudan, M. (1999). Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Trans. Inform. Theory. 45: 1757–1767.
   Web of Science ®Google Scholar
• Heydtmann, A. E., Jensen, J. M. (2000). On the equivalence of the Berlekamp-Massey and the Euclidean algorithms for decoding. IEEE Trans. Inform. Theory. 46: 2614–2624.
   Google Scholar
• Justesen, J., Høholdt, T. (2004). A Course in Error-Correcting Codes. EMS Textbooks in Mathematics. Zürich: European Mathematical Society (EMS).
   Google Scholar
• MacWilliams, F. J., Sloane, N. J. A. (1977). The Theory of Error-Correcting Codes. North-Holland Mathematical Library, Vol. 16, Amsterdam-New York-Oxford: North-Holland Publishing Co.
   Google Scholar
• Massey, J. L. (1969). Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory. IT-15: 122–127.
   Web of Science ®Google Scholar
• Mateer, T. D. (2011). On the equivalence of the Berlekamp–Massey and the Euclidean algorithms for algebraic decoding. In: Cheng, J., Schober, R., chairs. 12th Canadian Workshop on Information Theory (CWIT), 2011. Piscataway, NJ: IEEE, pp. 139–142.
   Google Scholar
• Mateer, T. D. (2013). Simple algorithms for decoding systematic Reed–Solomon codes. Des. Codes Cryptogr. 69: 107–121.
   Google Scholar
• Pellikaan, R. (1992). On decoding by error location and dependent sets of error positions. Discrete Math. 106/107: 369–381, A collection of contributions in honour of Jack van Lint.
   Google Scholar
• Pellikaan, R. (1996). On the existence of error-correcting pairs. J. Statist. Plann. Inference. 51: 229–242. Shanghai Conference Issue on Designs, Codes, and Finite Geometries, Part 1 (Shanghai, 1993).
   Google Scholar
• Peterson, W. W. (1960). Encoding and error-correction procedures for the Bose-Chaudhuri codes. IRE Trans. Inform. Theory. IT-6: 459–470.
   Google Scholar
• Reed, I. S., Solomon, G. (1960). Polynomial codes over certain finite fields. J. Soc. Indust. Appl. Math. 8: 300–304.
   Google Scholar
• Roman, S. (1997). Introduction to Coding and Information Theory. Undergraduate Texts in Mathematics. New York: Springer-Verlag.
   Google Scholar
• Roth, R. M. (2006). Introduction to Coding Theory. New York: Cambridge University Press.
   Google Scholar
• Shannon, C. E. (1948). A mathematical theory of communication. Bell System Tech. J. 27: 379–423, 623–656.
   Web of Science ®Google Scholar
• Sudan, M. (1997). Decoding of Reed Solomon codes beyond the error-correction bound. J. Complex. 13: 180–193.
   Google Scholar
• Sugiyama, Y., Kasahara, M., Hirasawa, S., Namekawa, T. (1975). A method for solving key equation for decoding Goppa codes. Inform. Control. 27: 87–99.
   Google Scholar
• Welch, L. R., Berlekamp, E. R. (1986). Error correction for algebraic block codes. U.S. Patent 4,633,470.
   Google Scholar