This a partial reproduction of my professionnal webpage as it was from 2009/10/01 to 2014/09/30. During this period I was in the french academic system doing research and teaching mainly at École polytechnique, Palaiseau, France. All details are given below. Now I am in the private sector working as a research and software engineer in the fields of what salesmen call high performance computing (HPC) and Bigdata.
My area of interests include algebra, algebraic number theory, computer algebra, computer algebra systems, algebraic geometry, and their applications to error correcting codes and cryptography. See the publications section below. My current work is focused on:
I also implement in C and C++ the algorithms of my papers. I contribute to the Mathemagix project and I also create separate standalone C libraries. See the softwares section below.
I did my PhD thesis under the supervision of Daniel Augot and Grégoire Lecerf at the computer science laboratory at École polytechnique. More details can be found in this dedicated page.
@article{BerLecQui2013,
author = {{B}erthomieu, {J}. and {L}ecerf, {G}. and
{Q}uintin, {G}.},
title = {{P}olynomial root finding over local rings and
application to error correcting codes},
year = {2013},
volume = {24},
number = {6},
journal = {{A}pplicable {A}lgebra in {E}ngineering,
{C}ommunication and {C}omputing},
pages = {1--31},
doi = {10.1007/s00200-013-0200-5},
publisher = {{S}pringer {B}erlin {H}eidelberg}
}
@article{QBC2013,
author = {{Q}uintin, {G}. and {B}arbier, {M}. and {C}habot, {C}.},
journal = {{I}nformation {T}heory, {IEEE} {T}ransactions on},
title = {{O}n {G}eneralized {R}eed-{S}olomon {C}odes {O}ver
{C}ommutative and {N}oncommutative {R}ings},
year = {2013},
volume = {59},
number = {9},
pages = {5882--5897},
doi = {10.1109/TIT.2013.2264797}
}
@inproceedings{BarPerQui2012,
author = {{B}arbier, {M}. and {P}ernet, {C}. and {Q}uintin, {G}.},
title = {{O}n the decoding of quasi-{BCH} codes},
year = {2013},
month = {April},
booktitle = {{P}re-{P}roceedings of the {I}nternational {W}orkshop
on {C}oding and {C}ryptography 2013}
}
@article{Qui2013,
author = {{Q}uintin, {G}uillaume},
title = {{T}he decoding {L}ibrary for list decoding},
journal = {{ACM} {C}ommun. {C}omput. {A}lgebra},
issue_date = {{S}eptember/{D}ecember 2012},
volume = {46},
number = {3/4},
month = jan,
year = {2013},
pages = {168--170},
numpages = {3},
publisher = {{ACM}},
address = {{N}ew {Y}ork, {NY}, {USA}},
}
@inproceedings{Qui2012,
author = {{Q}uintin, {G}.},
booktitle = {{I}nformation {T}heory {P}roceedings ({ISIT}),
2012 {IEEE} {I}nternational {S}ymposium on},
title = {{A} lifting decoding scheme and its application
to interleaved linear codes},
year = {2012},
pages = {96--100},
}
@inproceedings{BiaQui2012,
author = {{B}iasse, {J}.-{F}. and {Q}uintin, {G}.},
booktitle = {{I}nformation {T}heory {P}roceedings ({ISIT}),
2012 {IEEE} {I}nternational {S}ymposium on},
title = {{A}n algorithm for list decoding number field codes},
year = {2012},
pages = {91--95},
}
@article{BarChaQui2012,
author = {{B}arbier, {M}. and {C}habot, {C}. and {Q}uintin, {G}.},
title = {{O}n quasi-cyclic codes as a generalization of cyclic
codes},
journal = {{F}inite {F}ields and {T}heir {A}pplications},
volume = {18},
number = {5},
pages = {904--919},
year = {2012},
}
@inproceedings{RaQuiOoiGanMilCha2011,
author = {{R}aman, {B}alaji and {Q}uintin, {G}uillaume
and {O}oi, {W}ei {T}sang
and {G}angadharan, {D}eepak and {M}ilan, {J}erome
and {C}hakraborty, {S}amarjit},
title = {{O}n buffering with stochastic guarantees in
resource-constrained media players},
booktitle = {{P}roceedings of the seventh {IEEE}/{ACM}/{IFIP}
international conference on {H}ardware/software
codesign and system synthesis},
series = {{CODES}+{ISSS} '11},
year = {2011},
isbn = {978-1-4503-0715-4},
location = {{T}aipei, {T}aiwan},
pages = {169--178},
numpages = {10},
publisher = {{ACM}},
address = {{N}ew {Y}ork, {NY}, {USA}},
}
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.
I am the creator and the maintainer of the decoding
library. It is a C library whose main goal is to implement as
efficiently as possible the Guruswami-Sudan algorithm. It is
written in C89 and is stand-alone. It is of course possible
(and recommended for efficiency) to use decoding
with external libraries such as
GMP
,
NTL
,
FLINT
and
MPFQ
.
The web page for
decoding
.
With Olivier
Ruatta and
Philippe
Gaborit we are the creators and the maintainers of the
imunal
library. It is a C library whose main
goal is to implement as efficiently as possible a deterministic
algorithm for computing algebraic immunities of boolean functions.
The web page for imunal
.
I have given several talks on my work:
I was a teaching assistant (chargé de TD) at École polytechnique. I worked mainly with Albert Cohen.