Magali Bardet
Bureau U2.2.7
Laboratoire d'Informatique Fondamentale et Appliquée de Rouen
Université de Rouen
Faculté des Sciences et des Techniques
Avenue de l'université
76801 SAINT ETIENNE DU ROUVRAY
Tél. : 02.32.95.52.98
Fax : 02.32.95.51.87
Mél. :
Page :
http://magali.bardet.free.fr
Research Areas:
Computer Algebra, Polynomial System solving, Analysis of Algorithms,
Cryptography, Error Correcting Codes.
Conference Paper:
- M. Bardet, J-C. Faugère, B. Salvy
and B-Y. Yang, ``Asymptotic Behaviour of the Degree
of Regularity of Semi-Regular Polynomial Systems'', in MEGA 2005, Eighth International
Symposium on Effective Methods in Algebraic Geometry, Porto Conte,
Alghero, Sardinia (Italy), May 27th - June 1st, 2005, 15 pages.
-
M. Bardet, J-C. Faugère and B. Salvy, "On the
complexity of Gröbner basis computation of semi-regular overdetermined
algebraic equations", in Proc. International Conference on
Polynomial System Solving (ICPSS, November 24 - 25 -
26, Paris, France), pages 71-75. [html, pdf,
ps]
- D. Augot, M. Bardet, and J-C. Faugère, "Efficient decoding of (binary) cyclic codes above the
correction capacity of the code using Gröbner bases", in
Proc. IEEE International Symposium on Information Theory 2003 (ISIT,
June 29 - July 4, Yokohama, Japan), page 362. [abstract
ps] [ISIT
submission ps] [Slides]
Inria Research Report:
-
M. Bardet, J.-C. Faugère and B. Salvy, "Complexity of Gröbner basis
computation for Semi-regular
Overdetermined sequences over GF(2) with solutions in GF(2)",
[RR-5049, December 2003]
-
D. Augot, M. Bardet and J.-C. Faugère,
"Efficient Decoding of (binary) Cyclic Codes beyond the correction
capacity of the code using Gröbner bases",
[RR-4652, November 2002]
(Full version of the ISIT conference paper)
Last update : October 3, 2005.
|