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

P. Charpin, A. Tietäväinen, and V. Zinoviev, On Binary Cyclic Codes with Minimum Distance d = 3, Problems of Information Transmission, vol.33, issue.11, pp.287-296, 1997.

P. Charpin, A. Tietäväinen, and V. Zinoviev, On the Minimum Distances of Non-Binary Cyclic Codes, Designs, Codes and Cryptography, vol.17, issue.1/3, pp.81-85, 1999.
DOI : 10.1023/A:1008354504832

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

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

G. Forney, On decoding BCH codes, IEEE Transactions on Information Theory, vol.11, issue.4, pp.549-557, 1965.
DOI : 10.1109/TIT.1965.1053825

C. Hartmann, Decoding beyond the BCH bound (Corresp.), IEEE Transactions on Information Theory, vol.18, issue.3, pp.441-444, 1972.
DOI : 10.1109/TIT.1972.1054824

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. Hartmann and K. Tzeng, Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.), IEEE Transactions on Information Theory, vol.20, issue.2, 1974.
DOI : 10.1109/TIT.1974.1055178

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

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

J. Massey, Reversible codes, Information and Control, vol.7, issue.3, pp.369-380, 1964.
DOI : 10.1016/S0019-9958(64)90438-3

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

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-232, 1982.
DOI : 10.1016/0097-3165(82)90014-0

C. Roos, A new lower bound for the minimum distance of a cyclic code, IEEE Transactions on Information Theory, vol.29, issue.3, pp.330-332, 1983.
DOI : 10.1109/TIT.1983.1056672

Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, A method for solving key equation for decoding goppa codes, Information and Control, vol.27, issue.1, pp.87-99, 1975.
DOI : 10.1016/S0019-9958(75)90090-X

A. Zeh, A. Wachter-zeh, and S. Bezzateev, Decoding Cyclic Codes up to a New Bound on the Minimum Distance, IEEE Transactions on Information Theory, vol.58, issue.6, pp.3951-3960, 2012.
DOI : 10.1109/TIT.2012.2185924
URL : https://hal.archives-ouvertes.fr/hal-00975947

A. Zeh and S. Bezzateev, Describing a cyclic code by another cyclic code, 2012 IEEE International Symposium on Information Theory Proceedings, pp.2896-2900, 2012.
DOI : 10.1109/ISIT.2012.6284054
URL : https://hal.archives-ouvertes.fr/hal-00689746

L. H. Zetterberg, Cyclic codes from irreducible polynomials for correction of multiple errors, IEEE Transactions on Information Theory, vol.8, issue.1, pp.13-20, 1962.
DOI : 10.1109/TIT.1962.1057682