L. A. Bassalygo, New upper bounds for error correcting codes, Problemy Peredachi Informatsii, vol.1, issue.4, pp.41-44, 1965.

]. P. Del73 and . Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Rep, issue.10, p.97, 1973.

J. H. Griesmer, A Bound for Error-Correcting Codes, IBM Journal of Research and Development, vol.4, issue.5, pp.532-542, 1960.
DOI : 10.1147/rd.45.0532

[. Guerrini, Systematic codes and polynomial ideals, 2009.

V. [. Huffman and . Pless, Fundamentals of error-correcting codes, 2003.
DOI : 10.1017/CBO9780511807077

]. S. Joh62 and . Johnson, A new upper bound for error-correcting codes, Information Theory, IRE Transactions on, vol.8, issue.3, pp.203-207, 1962.

]. V. Lev98 and . Levenshtein, Universal bounds for codes and designs, Handbook of Coding Theory, pp.499-648, 1998.

S. [. Laihonen and . Litsyn, On upper bounds for minimum distance and covering radius of non-binary codes, Designs, Codes and Cryptography, pp.71-80, 1998.

. Mag and . Magma, Computational Algebra System for Algebra, Number Theory and Geometry, The University of Sydney Computational Algebra Group

R. [. Pless, W. C. Brualdi, and . Huffman, Handbook of coding theory, 1998.

M. Plotkin, Binary codes with specified minimum distance, Information Theory, IRE Transactions on, vol.6, issue.4, pp.445-450, 1960.