Skip to Main content Skip to Navigation

hal-00823535v1  Conference papers
Daniel AugotPierre LoidreauGwezheneg Robert. Rank metric and Gabidulin codes in characteristic zero
ISIT 2013 IEEE International Symposium on Information Theory, Amos Lapidoth and Igal Sason and Jossy Sayir and Emre Telatar, Jul 2013, Istanbul, Turkey
hal-00643794v1  Conference papers
Daniel AugotMorgan BarbierAlain Couvreur. List-Decoding of Binary Goppa Codes up to the Binary Johnson Bound
IEEE Information Theory Workshop, Oct 2011, Paraty, Brazil. pp.229 - 233, ⟨10.1109/ITW.2011.6089384⟩
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-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-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-00509188v2  Conference papers
Daniel AugotMatthieu FiniaszNicolas Sendrier. A Family of Fast Syndrome Based Cryptographic Hash Functions
MYCRYPT 2005 : First International Conference on Cryptology in Malaysia, Sep 2005, Kuala Lumpur, Malaysia. pp.64-83, ⟨10.1007/11554868_6⟩
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-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-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-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⟩