138 citations · 509 across the 16 of their papers we have counts for
4 papers · 1 filter
Polynomial time key-recovery attack on high rate random alternant codes
Magali Bardet, Rocco Mora, Jean-Pierre Tillich
A long standing open question is whether the distinguisher of high rate alternant codes or Goppa codes \cite{FGOPT11} can be turned into an algorithm recovering the algebraic struc…
Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach
Magali Bardet, Rocco Mora, Jean-Pierre Tillich
Decoding a Reed-Solomon code can be modeled by a bilinear system which can be solved by Gröbner basis techniques. We will show that in this particular case, these techniques are mu…
Algebraic Properties of Polar Codes From a New Polynomial Formalism
Magali Bardet, Vlad Dragoi, Ayoub Otmani +1
Polar codes form a very powerful family of codes with a low complexity decoding algorithm that attain many information theoretic limits in error correction and source coding. These…
On formulas for decoding binary cyclic codes
Daniel Augot, Magali Bardet, Jean-Charles Faugère
We adress the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to find the…