1. Augot, D., Bardet, M., Faugère, J.-C., 2003. Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Gröbner bases, In: Proceedings of the 2003 IEEE International Symposium on Information Theory, pp. 362–362
2. Studying the locator polynomial of minimum weight codewords of BCH codes;Augot;IEEE Transactions on Information Theory,1992
3. Bardet, M., 2004. Étude des systémes algébriques surdeterminés. Applications aux codes correcteurs et à la cryptographie. Ph.D. Thesis, Université Paris 6
4. On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations;Bardet,2004
5. Bardet, M., Faugère, J.C., Salvy, B., 2005. Asymptotic expansion of the degree of regularity for semi-regular systems of equations, In: P. Gianni (Ed.). Mega 2005 Sardinia (Italy), 2005, 15 pages