Skip to Main content Skip to Navigation


...
inria-00123312v1  Conference papers
Daniel AugotMagali BardetJean-Charles Faugère. On formulas for decoding binary cyclic codes
IEEE International Symposium on Information Theory, 2007 (ISIT 2007), Jun 2007, Nice, France. pp.2646-2650, ⟨10.1109/ISIT.2007.4557618⟩
...
tel-00159149v1  Habilitation à diriger des recherches
Daniel Augot. Décodage des codes algébriques et cryptographie
Génie logiciel [cs.SE]. Université Pierre et Marie Curie - Paris VI, 2007
...
inria-00414950v1  Conference papers
Daniel AugotRaghav BhaskarValérie IssarnyDaniele Sacchetti. An Efficient Group Key Agreement Protocol for Ad Hoc Networks
International Conference on a World of Wireless, Mobile and Multimedia Networks : WOWMOM 2005, 2005, Taormina, Italy. pp.576-580
...
inria-00509209v1  Conference papers
Daniel AugotAlexander Zeh. On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm
Information Theory, 2008. ISIT 2008. IEEE International Symposium on, Jul 2008, Toronto, Canada. pp.2620-2624, ⟨10.1109/ISIT.2008.4595466⟩
inria-00509213v1  Directions of work or proceedings
Daniel AugotJean-Charles FaugèreLudovic Perret. Gröbner Bases in Cryptography, Coding Theory, and Algebraic Combinatorics
Augot, Daniel; Faugère, Jean-Charles; Perret, Ludovic. France. 44 (12), Elsevier, pp.1605-1724, 2009, Journal of Symbolic Computation, ⟨10.1016/j.jsc.2008.11.004⟩
...
inria-00509219v1  Journal articles
Daniel AugotMagali BardetJean-Charles Faugère. On the decoding of binary cyclic codes with the Newton's identities
Journal of Symbolic Computation, Elsevier, 2009, Gröbner Bases in Cryptography, Coding Theory, and Algebraic Combinatorics, 44 (12), pp.1608-1625. ⟨10.1016/j.jsc.2008.02.006⟩
...
inria-00509269v1  Conference papers
Daniel AugotMagali BardetJean-Charles Faugère. Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Grobner bases
IEEE International Symposium on Information Theory - ISIT'2003, Jun 2003, Yokohama, Japan. pp.362 - 362, ⟨10.1109/ISIT.2003.1228378⟩
...
inria-00509339v1  Journal articles
Daniel AugotLancelot Pecquet. A Hensel Lifting to Replace Factorization in List-Decoding of Algebraic-Geometric and Reed-Solomon Codes
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2000, 46 (7), pp.2605 - 2614. ⟨10.1109/18.887868⟩
...
inria-00509424v1  Conference papers
Daniel Augot. Newton's identities for minimum codewords of a family of alternant codes
1995 IEEE International Symposium on Information Theory, Sep 1995, Whistler, Canada. pp.349, ⟨10.1109/ISIT.1995.550336⟩
...
inria-00509468v1  Conference papers
Daniel Augot. Algebraic Solutions of Newton's identities for cyclic codes
1998 Information Theory Workshop, Aug 1998, Killarney, Ireland. pp.49, ⟨10.1109/ITW.1998.706411⟩
...
inria-00509478v1  Journal articles
Daniel AugotFrançoise Levy-Dit-Vehel. Bounds on the minimum distance of the duals of BCH codes
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 1996, 42 (4), pp.1257 - 1260. ⟨10.1109/18.508853⟩
...
inria-00509482v1  Conference papers
Daniel AugotFrançoise Levy-Dit-Vehel. Bounds on the minimum distance of the duals of BCH codes
1994 IEEE International Symposium on Information Theory, Jun 1994, Trondheim, Norway. pp.43, ⟨10.1109/ISIT.1994.394928⟩
...
inria-00543322v1  Conference papers
Daniel Augot. Les codes algébriques principaux et leur décodage
Journées Nationales de Calcul Formel, Jean-Guillaume Dumas, Grégoire Lecerf, Delphine Boucher et Thomas Cluzeau, May 2010, Luminy, France. pp.31-74
...
inria-00547445v1  Conference papers
Daniel Augot. Problématique des bons codes sur le corps à deux éléments
Journées de la Société Mathémarique de France, Jun 2010, Paris, France
...
inria-00550061v1  Book sections
Daniel AugotEmmanuela OrsiniEmanuele Betti. An introduction to linear and cyclic codes
Sala, Massimiliano and Mora, Teo and Perret, Ludovic and Sakata, Shojiro and Traverso, Carlo. Gröbner Bases, Coding, and Cryptography, Springer-Verlag, pp.47-68, 2009, Gröbner Bases, Coding, and Cryptography, ⟨10.1007/978-3-540-93806-4_4⟩
inria-00564022v1  Book sections
Daniel AugotMichael Stepanov. A note on the generalisation of the Guruswami-Sudan list decoding algorithm to Reed-Muller codes
Massimiliano Sala and Teo Mora and Ludovic Perret and Shojiro Sakata and Carlo Traverso. Gröbner Bases, Coding, and Cryptography, 2, Springer, pp.395-398, 2009, ⟨10.1007/978-3-540-93806-4_27⟩
...
inria-00633205v1  Journal articles
Alexander ZehChristian GentnerDaniel Augot. An Interpolation Procedure for List Decoding Reed--Solomon codes Based on Generalized Key Equations
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2011, 57, pp.5946-5959. ⟨10.1109/TIT.2011.2162160⟩