R. C. Bose and D. K. Ray-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

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

C. R. 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. R. Hartmann and K. 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

S. D. Berman, Semisimple cyclic and Abelian codes. II, Cybernetics, vol.3, issue.3, pp.17-23, 1967.
DOI : 10.1007/BF01119999

J. L. Massey, D. Costello, and J. Justesen, Polynomial weights and code constructions, IEEE Transactions on Information Theory, vol.19, issue.1, pp.101-110, 1973.
DOI : 10.1109/TIT.1973.1054936
URL : http://orbit.dtu.dk/ws/files/4637283/J%C3%B8rn.pdf

J. L. Massey, N. Von-seemann, and P. Schöller, Hasse Derivatives and Repeated-Root Cyclic Codes, IEEE International Symposium on Information Theory (ISIT), p.39, 1986.

V. C. Da-rocha-jr, On Repeated-Single-Root Constacyclic Codes, " in Communications and Cryptography, ser. The Springer International Series in Engineering and Computer Science, pp.93-99, 1994.

G. Castagnoli, On the Minimum Distance of Long Cyclic Codes and Cyclic Redundancy Check Codes, 1989.

G. Castagnoli, J. L. Massey, P. A. Schöller, and N. Von-seemann, On repeated-root cyclic codes, IEEE Transactions on Information Theory, vol.37, issue.2, pp.337-342, 1991.
DOI : 10.1109/18.75249

R. K. Latypov, Checking matrix of a cyclic code generated by multiple roots, Journal of Soviet Mathematics, vol.43, issue.3, pp.2492-2495, 1988.
DOI : 10.1007/BF01095658

J. Van-lint, Repeated-root cyclic codes, IEEE Transactions on Information Theory, vol.37, issue.2, pp.343-345, 1991.
DOI : 10.1109/18.75250

K. Zimmermann, On generalizations of repeated-root cyclic codes, IEEE Transactions on Information Theory, vol.42, issue.2, pp.641-649, 1996.
DOI : 10.1109/18.485736

C. Nedeloaia, Weight distributions of cyclic self-dual codes, IEEE Transactions on Information Theory, vol.49, issue.6, pp.1582-1591, 2003.
DOI : 10.1109/TIT.2003.811921

S. Ling, H. Niederreiter, and P. Solé, On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots, Designs, Codes and Cryptography, vol.51, issue.3, pp.337-361, 2006.
DOI : 10.1007/s10623-005-1431-7

H. Q. Dinh, Repeated-Root Constacyclic Codes of Length 2p s , " Finite Fields Th, App, vol.18, issue.1, pp.133-143, 2012.

A. Zeh and S. V. Bezzateev, A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes, Designs, Codes and Cryptography, vol.8, issue.1, pp.229-246, 2014.
DOI : 10.1007/s10623-012-9721-3
URL : https://hal.archives-ouvertes.fr/hal-00710290

A. Zeh, A. Wachter-zeh, and S. V. 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

H. Burton and E. J. Weldon, Cyclic product codes, IEEE Transactions on Information Theory, vol.11, issue.3, pp.433-439, 1965.
DOI : 10.1109/TIT.1965.1053802

S. Lin and E. J. Weldon, Further results on cyclic product codes, IEEE Transactions on Information Theory, vol.16, issue.4, pp.452-459, 1970.
DOI : 10.1109/TIT.1970.1054491

G. Feng and K. K. Tzeng, A generalized Euclidean algorithm for multisequence shift-register synthesis, IEEE Transactions on Information Theory, vol.35, issue.3, pp.584-594, 1989.
DOI : 10.1109/18.30981

H. Hasse, Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik, Journal für die Reine und Angewandte Mathematik, issue.175, pp.50-54, 1936.

V. Y. Krachkovsky and Y. X. Lee, Decoding for iterative Reed-Solomon coding schemes, IEEE Transactions on Magnetics, vol.33, issue.5, pp.2740-2742, 1997.
DOI : 10.1109/20.617715

V. R. Sidorenko, G. Schmidt, and M. Bossert, Decoding Punctured Reed?Solomon Codes up to the Singleton Bound, International ITG Conference on Source and Channel Coding (SCC), 2008.

V. Guruswami, Linear-Algebraic List Decoding of Folded Reed-Solomon Codes, 2011 IEEE 26th Annual Conference on Computational Complexity, pp.77-85, 2011.
DOI : 10.1109/CCC.2011.22

G. Feng and K. K. Tzeng, A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes, IEEE Transactions on Information Theory, vol.37, issue.5, pp.1274-1287, 1991.
DOI : 10.1109/18.133246

A. Zeh and A. Wachter, Fast Multi-Sequence Shift-Register Synthesis with the Euclidean Algorithm, Adv. Math. of Comm, vol.5, issue.4, pp.667-680, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00647586

F. J. Macwilliams and N. J. Sloane, The Theory of Error-Correcting Codes, 1988.

A. Zeh, A. Wachter-zeh, M. Gadouleau, and S. V. Bezzateev, Generalizing bounds on the minimum distance of cyclic codes using cyclic product codes, 2013 IEEE International Symposium on Information Theory, pp.126-130, 2013.
DOI : 10.1109/ISIT.2013.6620201
URL : https://hal.archives-ouvertes.fr/hal-00828083

V. Y. Krachkovsky, Decoding of parallel Reed-Solomon codes with applications to product and concatenated codes, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), p.55, 1998.
DOI : 10.1109/ISIT.1998.708636

G. Schmidt, V. R. Sidorenko, and M. Bossert, Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs, IEEE Transactions on Information Theory, vol.55, issue.7, pp.2991-3012, 2009.
DOI : 10.1109/TIT.2009.2021308

P. Gopalan, V. Guruswami, and P. Raghavendra, List Decoding Tensor Products and Interleaved Codes, SIAM Journal on Computing, vol.40, issue.5, pp.1432-1462, 2011.
DOI : 10.1137/090778274
URL : http://arxiv.org/abs/0811.4395