A. Hocquenghem, Codes Correcteurs d'Erreurs, Chiffres (Paris), vol.2, pp.147-156, 1959.

R. C. Bose and D. K. Chaudhuri, On a class of error correcting binary group codes, Information and Control, vol.3, issue.1, pp.68-79, 1960.
DOI : 10.1016/S0019-9958(60)90287-4

C. Hartmann and K. Tzeng, Generalizations of the BCH bound, Information and Control, vol.20, issue.5, pp.489-498, 1972.
DOI : 10.1016/S0019-9958(72)90887-X

C. Roos, A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound, Journal of Combinatorial Theory, Series A, vol.33, issue.2, pp.229-2320097, 1982.
DOI : 10.1016/0097-3165(82)90014-0

J. Van-lint and R. Wilson, On the minimum distance of cyclic codes, IEEE Transactions on Information Theory, vol.32, issue.1, pp.23-40, 1986.
DOI : 10.1109/TIT.1986.1057134

I. M. Duursma and R. Koetter, Error-locating pairs for cyclic codes Information Theory, IEEE Transactions on, vol.40, issue.4, pp.1108-1121, 2002.

I. M. Duursma and R. Pellikaan, A symmetric Roos bound for linear codes, Journal of Combinatorial Theory, Series A, vol.113, issue.8, pp.1677-1688, 2006.
DOI : 10.1016/j.jcta.2006.03.020

N. Boston, Bounding minimum distances of cyclic codes using algebraic geometry, Electronic Notes in Discrete Mathematics, vol.6, pp.385-394, 2001.
DOI : 10.1016/S1571-0653(04)00190-8

E. Betti and M. Sala, A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set Information Theory, IEEE Transactions on, vol.52, issue.8, pp.3700-3706876240, 2006.

A. Zeh, A. Wachter, and S. Bezzateev, Efficient decoding of some classes of binary cyclic codes beyond the Hartmann-Tzeng bound, 2011 IEEE International Symposium on Information Theory Proceedings, pp.1017-1021, 2011.
DOI : 10.1109/ISIT.2011.6033683
URL : https://hal.archives-ouvertes.fr/hal-00647590

G. L. Feng and K. K. Tzeng, Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations, IEEE Transactions on Information Theory, vol.37, issue.6, pp.1716-1723, 1991.
DOI : 10.1109/18.104340

I. S. Reed and G. Solomon, Polynomial Codes Over Certain Finite Fields, Journal of the Society for Industrial and Applied Mathematics, vol.8, issue.2, pp.300-304, 1960.
DOI : 10.1137/0108018