93 citations · 387 across the 28 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2014
Folding Alternant and Goppa Codes with Non-Trivial Automorphism Groups
Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret +2
The main practical limitation of the McEliece public-key encryption scheme is probably the size of its key. A famous trend to overcome this issue is to focus on subclasses of alter…
cs.IT2007★ 5 cited
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…