Guillaume Quintin
PhD student at the computer science laboratory
at École polytechnique
under the supervision of
Daniel Augot
and
Grégoire Lecerf.
École polytechnique
Laboratoire d'informatique (LIX)
91128 Palaiseau Cedex
France
You can contact me at quintin [at] lix.polytechnique.fr
or by telephone: +33 (0)1 69 33 40 77
Research
My area of interests include algebra, algebraic number theory,
computer algebra, computer algebra systems, algebraic geometry,
and their applications to error correcting codes. I work mainly on
the Guruswami-Sudan algorithm, try to adapt it to evaluation
codes (such as Reed-Solomon codes over finite rings and fields,
number fields codes and algebraic geometry codes over finite rings
and fields) and to implement it.
Submitted and accepted papers
2012
-
On Generalized Reed-Solomon Codes Over Commutative and
Noncommutative Rings
Quintin Guillaume, Barbier Morgan, Chabot Christophe
submitted
pdf file
-
A Lifting Decoding Scheme and its Application to
Interleaved Linear Codes
Quintin Guillaume
submitted
pdf file
-
An algorithm for list decoding number field codes
Jean-François Biasse, Guillaume Quintin
submitted
pdf file (soon available)
2011
-
Polynomial root finding over local rings and
application to error correcting codes
Berthomieu Jérémy, Lecerf Grégoire,
Quintin Guillaume
submitted
pdf file
-
On Quasi-Cyclic Codes as a Generalization of Cyclic Codes
Barbier Morgan, Chabot Christophe, Quintin Guillaume
submitted
pdf file
2010
-
On Buffering with Stochastic Guarantees in
Resource-Constrained Media Players
Balaji Raman, Guillaume Quintin, Wei Tsang Ooi,
Deepak Gangadharan, Jerome Milan, Samarjit Chakraborty
Proceedings of the International conference on Hardware/Software
Codesign and System Synthesis (CODES+ISSS),
Pages 169-178, Taipei, October 9-14th, 2011.
pdf file
Software
Mathemagix
I am the maintainer (with Grégoire Lecerf) of three packages
of the
Mathemagix
computer algebra system. My main goal is to implement decoding
algorithms for evaluation codes over finite rings and fields in order
to study their performences and improve them.
The Sudan list decoding algorithm is present in my package named
quintix.
With Grégoire Lecerf, we designed and maintain the following
packages:
-
mgf2x — a wrapper to the gf2x
library.
-
finitefieldz — the official finite fields
implementation of Mathemagix.
-
quintix — my personnal package which contains
an implementation of Galois rings and the Sudan decoding algorithm.
Talks
I have given several talks on my work:
-
Root-finding in function fields for list-decoding.
Soria Summer School on Computational Mathematics.
14/07/2010, Soria, Spain.
-
List decoding algorithms of certain evaluation codes over
finite rings.
Journées Codage et Cryptographie (C2).
04/04/2011, Saint Pierre d'Oléron, France.
-
Root-finding in Galois rings and application to error
correcting codes.
Journées Nationales de Calcul Formel (JNCF).
14/11/2011, CIRM, Luminy, France.
-
Over quasi-cyclic codes as a generalisation of cyclic codes.
University of Limoges.
06/12/2011, Limoges, France.
-
On Generalized Reed-Solomon Codes Over Commutative and
Noncommutative Rings.
University of Versailles.
06/02/2011, Versailles, France.
-
A Lifting Decoding Scheme, its Application to Interleaved
Linear Codes and Implementation.
University of Caen.
06/12/2011, Caen, France.
Teaching
I am a teaching assistant (chargé de TD) at École
polytechnique. I work mainly with
Albert Cohen.
(The VirtualBox VM is here.)
2011-2012
-
Operating Systems Principles and Programming —
INF583
(18h)
-
Components of a Computing System —
INF422
(36h)
2010-2011
-
Operating Systems Principles and Programming —
INF583
(18h)
-
Components of a Computing System —
INF422
(36h)
-
Introduction to computer science —
INF311
(substitute teaching for 10h)
2010-2009
-
Introduction to computer science —
INF311
(32h)