S. Sakata, H. Jensen, and T. Høholdt, Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound, IEEE Transactions on Information Theory, vol.41, issue.6, pp.1762-1768, 1995.
DOI : 10.1109/18.476248

S. Sakata and M. Fujisawa, Fast Decoding of Multipoint Codes from Algebraic Curves, IEEE Transactions on Information Theory, vol.60, issue.4, pp.2054-2064, 2014.
DOI : 10.1109/TIT.2014.2300473
URL : https://hal.archives-ouvertes.fr/hal-01275736

S. Sakata, Finding a minimal polynomial vector set of a vector of nD arrays, LNSC, vol.539, pp.414-425, 1991.
DOI : 10.1007/3-540-54522-0_129

S. Sakata, J. Justesen, Y. Madelung, H. Jensen, and T. Høholdt, A Fast Decoding Method of AG Codes from Miura-Kamiya Curves Cab up to Half the Feng-Rao Bound, Finite Fields and Their Applications, vol.1, issue.1, pp.83-101, 1994.
DOI : 10.1006/ffta.1995.1006

R. Kötter, A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic geometry codes, IEEE Trans. Inform. Th, vol.44, pp.1358-1368, 1998.

P. Beelen and K. Brander, Efficient list decoding of a class of algebraic geometry codes, Advances in Mathematics of Communications, pp.485-518, 2010.

K. Lee, M. B. Amoros, and M. E. O-'sullivan, Unique Decoding of Plane AG Codes via Interpolation, IEEE Transactions on Information Theory, vol.58, issue.6, pp.3941-3950, 2012.
DOI : 10.1109/TIT.2012.2182757

M. Homma and S. J. Kim, The Complete Determination of the Minimum Distance of Two-Point Codes on a Hermitian Curve, Designs, Codes and Cryptography, vol.22, issue.1, pp.5-24, 2006.
DOI : 10.1007/s10623-005-4599-y

N. Drake and G. Matthews, Minimum Distance Decoding of General Algebraic Geometry Codes via Lists, IEEE Transactions on Information Theory, vol.56, issue.9, pp.4335-4340, 2010.
DOI : 10.1109/TIT.2010.2054670

V. D. Goppa, Codes associated with divisors, Probl. Pered. Inform. Translation: Probl. Inform. Trans, vol.13, issue.13, pp.33-3922, 1977.

G. Feng and T. R. Rao, Decoding algebraic-geometric codes up to the designed minimum distance, IEEE Transactions on Information Theory, vol.39, issue.1, pp.37-45, 1993.
DOI : 10.1109/18.179340

T. Høholdt, J. H. Van-lint, and R. Pellikaan, algebraic geometry codes Handbook of Coding Theory, pp.871-961, 1998.

P. Beelen, The order bound for general algebraic geometric codes, Finite Fields and Their Applications, vol.13, issue.3, pp.665-680, 2007.
DOI : 10.1016/j.ffa.2006.09.006

K. Kirfel and R. Pellikaan, The minimum distance of codes in an array coming from telescopic semigroups, IEEE Transactions on Information Theory, vol.41, issue.6, pp.1720-1732, 1995.
DOI : 10.1109/18.476245

I. M. Duursma, R. Kirov, and S. Park, Distance bounds for algebraic geometric codes, Journal of Pure and Applied Algebra, vol.215, issue.8, pp.1863-1878, 2011.
DOI : 10.1016/j.jpaa.2010.10.018

K. Lee, M. B. Amoros, and M. E. O-'sullivan, Unique Decoding of General AG Codes, IEEE Transactions on Information Theory, vol.60, issue.4, pp.2038-2053, 2014.
DOI : 10.1109/TIT.2014.2306816

O. Geil and R. Pelikaan, On the Structure of Order Domains, Finite Fields and Their Applications, vol.8, issue.3, pp.369-396, 2002.
DOI : 10.1006/ffta.2001.0347

R. Matsumoto and S. Miura, On construction and generalization of algebraic geomery codes, Proc. Algebraic Geometry, Number Theory, Coding Theory and Cryptography, pp.3-15, 2000.

O. Geil, R. Matsumoto, and D. Ruano, List decoding algorithm based on voting in Gröbner bases for general one-point AG codes, Proc. of International Synposium on Information Theory, pp.86-90, 2012.

. Sakata, The BMS Algorithm, Groebner Bases, Coding, and Cryptography, pp.143-163, 2009.
DOI : 10.1007/978-3-540-93806-4_9

T. Mora, Groebner Thechnology, Groebner Bases, Coding, and Cryptography, pp.1-25, 2009.