1. R. M. Roth and G. Ruckenstein, “Efficient decoding of Reed-Solomon codes beyond half the minimum distance,” IEEE Trans. Inform. Theory 46(1), 246–257 (2000).
2. H. Cohen, A Course in Computational Algebraic Number Theory, in Grad. Texts in Math. (Springer-Verlag, Berlin, 1996), Vol. 138.
3. V. Guruswami, List Decoding of Error-Correcting Codes, in Lecture Notes in Comput. Sci., Winning thesis of the 2002 ACM Doctoral Dissertation Competition (Springer-Verlag, Berlin, 2004), Vol. 3282
4. A. É. Maevskii, “An algorithm of list decoding for a class of algebraic-geometric codes on projective curves,” in Integral and Differential Equations (Don State Technical University, Rostov-on-Don, 2007), pp. 1–1 [in Russian].
5. E. Kaltofen, “Factorization of polynomials,” in Computer Algebra. Symbolic and Algebraic Computation 2nd ed., Ed. by B. Buchberger, G. E. Collins, R. Loos, and R. Albrecht (Springer-Verlag, Vienna, 1983), pp. 95–113 (Mir, Moscow, 1986), pp. 127–150.