Guillaume Quintin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Guillaume Quintin has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Jean-François Biasse
Florida Department of Mathematics and Statistics University of South
2 shared publications - Christophe Chabot
LJK 51 rue des mathématiques Campus de St Martin d'Hères BP 53 38041 Cedex 09 Grenoble France
1 shared publication - Clément Pernet
Cnrs Univ. Grenoble Alpes Grenoble inp -uga 38000 ljk Grenoble France
1 shared publication - Grégoire Lecerf
LIX, UMR 7161 CNRS
1 shared publication - Jérémy Berthomieu
Sorbonne Université CNRS LIP6 Paris France
1 shared publication - Morgan Barbier
Ecole Polytechnique Laboratoire d'Informatique (LIX) 91128 Palaiseau Cedex France
1 shared publication
Latest Publications
- 11 July 2013
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 24 (6) , 413-443
Polynomial root finding over local rings and application to error correcting codes
- 11 July 2013
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 24 (6) , 413-443
Polynomial root finding over local rings and application to error correcting codes
- Open Access
On the decoding of quasi-BCH codes
In this paper we investigate the structure of quasi-BCH codes. In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matrices extending the known relation about classical BCH and Reed-Solomon codes. This allows us to adapt the Welch-Berlekamp algorithm to quasi-BCH codes. In the second part of this paper we show that quasi-BCH codes can be seen as subcodes of interleaved Reed-Solomon codes over finite fields. This provides another approach for decoding quasi-BCH codes.
Open AccessOn the decoding of quasi-BCH codes
In this paper we investigate the structure of quasi-BCH codes. In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matrices extending the known relation about classical BCH and Reed-Solomon codes. This allows us to adapt the Welch-Berlekamp algorithm to quasi-BCH codes. In the second part of this paper we show that quasi-BCH codes can be seen as subcodes of interleaved Reed-Solomon codes over finite fields. This provides another approach for decoding quasi-BCH codes.
- Open Access
An algorithm for list decoding number field codes
We present an algorithm for list decoding codewords of algebraic number field codes in polynomial time. This is the first explicit procedure for decoding number field codes whose construction were previously described by Lenstra [12] and Guruswami [8]. We rely on a new algorithm for computing the Hermite normal form of the basis of an OK -module due to Biasse and Fieker [2] where OK is the ring of integers of a number field K.
Open AccessAn algorithm for list decoding number field codes
We present an algorithm for list decoding codewords of algebraic number field codes in polynomial time. This is the first explicit procedure for decoding number field codes whose construction were previously described by Lenstra [12] and Guruswami [8]. We rely on a new algorithm for computing the Hermite normal form of the basis of an OK -module due to Biasse and Fieker [2] where OK is the ring of integers of a number field K.
- Open Access
On Quasi-Cyclic Codes as a Generalization of Cyclic Codes
In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length m and ideals of M_l(Fq)[X]/(X^m-1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study the parameters of such codes and propose a decoding algorithm up to half the designed minimum distance. We even found one new quasi-cyclic code with better parameters than known [189, 11, 125]_F4 and 48 derivated codes beating the known bounds as well.
Open AccessOn Quasi-Cyclic Codes as a Generalization of Cyclic Codes
In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length m and ideals of M_l(Fq)[X]/(X^m-1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study the parameters of such codes and propose a decoding algorithm up to half the designed minimum distance. We even found one new quasi-cyclic code with better parameters than known [189, 11, 125]_F4 and 48 derivated codes beating the known bounds as well.
- Open Access
An algorithm for list decoding number field codes
We present an algorithm for list decoding codewords of algebraic number field codes in polynomial time. This is the first explicit procedure for decoding number field codes whose construction were previously described by Lenstra and Guruswami. We rely on an equivalent of the LLL reduction algorithm for $\OK$-modules due to Fieker and Stehl\'e and on algorithms due to Cohen for computing the Hermite normal form of matrices representing modules over Dedekind domains.
Open AccessAn algorithm for list decoding number field codes
We present an algorithm for list decoding codewords of algebraic number field codes in polynomial time. This is the first explicit procedure for decoding number field codes whose construction were previously described by Lenstra and Guruswami. We rely on an equivalent of the LLL reduction algorithm for $\OK$-modules due to Fieker and Stehl\'e and on algorithms due to Cohen for computing the Hermite normal form of matrices representing modules over Dedekind domains.