V. Abatangelo and B. Larato, Near-MDS codes arising from algebraic curves, Discrete Math, pp.5-19, 2005.
DOI : 10.1016/j.disc.2004.05.021
URL : http://doi.org/10.1016/j.disc.2004.05.021

V. Abatangelo and B. Larato, Elliptic near-MDS codes, Designs, Codes and Cryptography, pp.167-174, 2008.

T. I. Alderson and A. A. Bruen, Maximal AMDS codes, Applicable Algebra in Engineering, Communication and Computing, vol.2, issue.1???2, pp.87-98, 2008.
DOI : 10.1007/s00200-008-0058-0

S. Ball and A. Blokhuis, An easier proof of the maximal arcs conjecture, Proc. Amer, pp.3377-3380, 1998.

S. Ball, A. Blokhuis, and F. Mazzocca, Maximal arcs in Desarguesian planes of odd order do not exist, Combinatorica, vol.1, issue.1, pp.31-47, 1997.
DOI : 10.1007/BF01196129

S. Ball and J. Hirschfeld, Bounds on (n, r)-arcs and their application to linear codes, Finite Fields Appl, pp.326-336, 2005.

D. Bartoli, S. Marcugini, and F. Pambianco, The non-existence of some NMDS codes and the extremal sizes of complete (n, 3)-arcs in, Designs, Codes and Cryptography, pp.129-134, 2014.

M. De-boer, Almost MDS codes, Designs, Codes and Cryptography, vol.1993, issue.2, pp.143-155, 1996.
DOI : 10.1007/BF00124590

M. De-boer, Codes: their parameters and Geometry, 1997.

I. Boukliev and J. Simonis, Some New Results on Optimal Codes over F5, Designs, pp.97-111, 2003.

S. Dodunekov and I. Landjev, On near-MDS codes, Journal of Geometry, vol.37, issue.1-2, pp.30-43, 1995.
DOI : 10.1007/BF01222850

S. Dodunekov and I. Landjev, On the quaternary [11, 6, 5] and [12, 6, 6] Codes, Applications of Finite Fields, IMA Conference Series 59, pp.75-84, 19996.

S. Dodunekov and I. Landjev, Near-MDS Codes over Some Small Fields, Discrete Math, pp.55-65, 2000.
DOI : 10.1016/s0012-365x(99)00168-5
URL : http://doi.org/10.1016/s0012-365x(99)00168-5

S. Dodunekov and J. Simonis, Codes and projective multisets, The Electronic Journal of Combinatorics, vol.5, p.37, 1998.

I. I. Dumer and V. A. Zinoviev, Some New Maximal Codes over GF, Problemi Peredachi Informacii, pp.24-34, 1978.

M. Giulietti, On the Extendibility of Near-MDS Elliptic Codes, Applicable Algebra in Engineering, Communication and Computing, vol.15, issue.1, pp.1-11, 2004.
DOI : 10.1007/s00200-003-0141-5

M. Guilietti and F. Pasticci, On the completeness of certain n-tracks arising from elliptic curves, Finite Fields and Appl, pp.988-1000, 2007.

U. Heim, Blockierende Mengen in endlichen projecktiven Räumen, Litt. Math. Seminar Giessen, pp.1-82, 1995.

J. W. Hirschfeld and L. Storme, The packing problem in statistics, coding theory and finite projective spaces, Proc. Of the Fourth Isle of Thorns Conference (Chelwood Gate, pp.201-246, 2000.
DOI : 10.1016/S0378-3758(98)00043-3

S. Marcugini, A. Milani, and F. Pambianco, Maximal (n, 3)-arcs in PG, Discrete Math, pp.421-426, 1999.

S. Marcugini, A. Milani, and F. Pambianco, NMDS codes of maximal length over F/sub q/,8???q???11, IEEE Transactions on Information Theory, vol.48, issue.4, pp.963-966, 2002.
DOI : 10.1109/18.992802

S. Marcugini, A. Milani, and F. Pambianco, Classification of the (n, 3)-arcs in PG(2, 7), Journal of Geometry, vol.80, issue.1-2, pp.179-184, 2004.
DOI : 10.1007/s00022-004-1777-4

S. Marcugini, A. Milani, and F. Pambianco, Maximal (n, 3)-arcs in PG(2, 13), Discrete Math, pp.139-145, 1999.

S. Marcugini, A. Milani, and F. Pambianco, Classification of linear codes exploting an invariant, Contributions to discrete mathematics, vol.1, issue.1, pp.1-7, 2006.

J. A. Thas, Some results concerning {(q+1)(n???1);n}-arcs and {(q+1)(n???1)+1;n}-arcs in finite projective planes of order q, Journal of Combinatorial Theory, Series A, vol.19, issue.2, pp.228-232, 1975.
DOI : 10.1016/S0097-3165(75)80012-4

M. A. Tsfasman and S. G. Vladut, Algebraic-Geometric Codes, 1991.
DOI : 10.1007/978-94-011-3810-9

W. G. Waterhouse, Abelian varieties over finite fields, Annales scientifiques de l'??cole normale sup??rieure, vol.2, issue.4, pp.521-560, 1969.
DOI : 10.24033/asens.1183