1. Alekhnovich M.: Linear diophantine equations over polynomials and soft decoding of Reed–Solomon codes. IEEE Trans. Inf. Theory 51(7), 2257–2265 (2005).
2. Bassalygo L.A.: New upper bounds for error-correcting codes. Prob. Inf. Trans. 1(4), 41–44 (1965).
3. Beelen P., Brander K.: Key equations for list decoding of Reed–Solomon codes and how to solve them. J. Symb. Comput. 45(7), 773–786 (2010).
4. Beelen P., Høholdt T., Nielsen J.S.R., Wu Y.: On rational interpolation-based list-decoding and list-decoding binary Goppa codes. IEEE Trans. Inf. Theory 59(6), 3269–3281 (2013).
5. Bernstein D.J.: List decoding for binary Goppa codes. In: IWCC, LNCS, vol. 6639, pp. 62–80. Springer, Heidelberg (2011).