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
Codes Correcteurs d'Erreurs, Chiffres (Paris), vol.2, pp.147-156, 1959. ,
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
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
Generalizations of the BCH bound, Information and Control, vol.20, issue.5, pp.489-498, 1972. ,
DOI : 10.1016/S0019-9958(72)90887-X
Some results on the minimum distance structure of cyclic codes, IEEE Transactions on Information Theory, vol.18, issue.3, pp.402-409, 1972. ,
DOI : 10.1109/TIT.1972.1054816
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
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
Error-locating pairs for cyclic codes Information Theory, IEEE Transactions on, vol.40, issue.4, pp.1108-1121, 2002. ,
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
URL : http://doi.org/10.1016/j.jcta.2006.03.020
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
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 New Procedure for Decoding Cyclic and Bch Codes Up to Actual Minimum Distance, Proceedings. IEEE International Symposium on Information Theory, pp.1364-1374, 1994. ,
DOI : 10.1109/ISIT.1993.748410
Rational Representation of Codes and (L,g) Codes, Probl. Pered. Inform, vol.7, pp.41-49, 1971. ,
One Generalization of Goppa Codes, " in Information Theory, IEEE International Symposium on, pp. 299+. [Online]. Available, p.613221, 1997. ,
Cyclic (L,G) Codes, Probl. Pered. Inform, vol.17, pp.3-10, 1981. ,
Reversible codes, Information and Control, vol.7, issue.3, pp.369-380, 1964. ,
DOI : 10.1016/S0019-9958(64)90438-3
URL : http://doi.org/10.1016/s0019-9958(64)90438-3
On decoding BCH codes Information Theory, IEEE Transactions on, vol.11, issue.4, pp.549-557, 1965. ,
The Theory of Error-Correcting Codes (North-Holland Mathematical Library), 1988. ,
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