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
On the maximality of linear codes, Designs, pp.59-68, 2009. ,
On the Griesmer bound for nonlinear codes, arXiv, p.org, 2015. ,
Some Bounds on the Size of Codes, IEEE Transactions on Information Theory, vol.60, issue.3, pp.1475-1480, 2014. ,
DOI : 10.1109/TIT.2014.2298234
URL : https://hal.archives-ouvertes.fr/lirmm-01282040
An algebraic approach to the association schemes of coding theory, Philips Res. Rep, issue.10, p.97, 1973. ,
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
A first course in coding theory, 1986. ,
Fundamentals of error-correcting codes, 2003. ,
DOI : 10.1017/CBO9780511807077
On upper bounds for unrestricted binary-error-correcting codes, Information Theory, IEEE Transactions on, vol.17, issue.4, pp.466-478, 1971. ,
On codes meeting the Griesmer bound, Discrete Mathematics, vol.2743, issue.1, pp.289-297, 2004. ,
The application of Hadamard matrices to a problem in coding, Problems of Cybernetics, issue.5, pp.166-184, 1964. ,
On the Achievement of the Griesmer Bound, Designs, Codes and Cryptography, pp.83-87, 1997. ,
The theory of error-correcting codes. I and II, 1977. ,
Binary codes with specified minimum distance, Information Theory, IRE Transactions on, vol.6, issue.4, pp.445-450, 1960. ,
Algebraically punctured cyclic codes, Information and Control, vol.8, issue.2, pp.170-179, 1965. ,
DOI : 10.1016/S0019-9958(65)90080-X
On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound, pp.44-60, 1980. ,