1. Recherche
27 résultats  enregistrer la recherche
...
inria-00550061v1  Chapitre d'ouvrage
Daniel Augot, Emmanuela Orsini, Emanuele 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-00547106v1  Rapport
Daniel Augot, Morgan Barbier, Alain Couvreur. List-decoding of binary Goppa codes up to the binary Johnson bound
[Research Report] RR-7490, INRIA. 2010, pp.23
...
hal-00672050v1  Pré-publication, Document de travail
Daniel Augot, François Morain. Discrete logarithm computations over finite fields using Reed-Solomon codes
2012
...
inria-00509219v1  Article dans une revue
Daniel Augot, Magali Bardet, Jean-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. <http://www.sciencedirect.com/science/article/B6WM7-4V2NKC8-1/2/7fbca42d51ecd00f706121b11a52a44b>. <10.1016/j.jsc.2008.02.006>
hal-00741923v1  Direction d'ouvrage, Proceedings
Daniel Augot, Anne Canteaut, Gohar Kyureghyan, Faina Solov'Eva, Øyvind Ytrehus. Editorial
Daniel Augot and Anne Canteaut and Gohar Kyureghyan and Faina Solov'eva and Øyvind Ytrehus. Springer, pp.2, 2012, Designs, Codes and Cryptography, <10.1007/s10623-012-9731-1>
inria-00509213v1  Direction d'ouvrage, Proceedings
Daniel Augot, Jean-Charles Faugère, Ludovic Perret. Gröbner Bases in Cryptography, Coding Theory, and Algebraic Combinatorics
Augot, Daniel and Faugère, Jean-Charles and Perret, Ludovic. France. 44 (12), Elsevier, pp.1605-1724, 2009, Journal of Symbolic Computation, <10.1016/j.jsc.2008.11.004>
...
tel-00723227v1  Thèse
Daniel Augot. Étude algèbrique des mots de poids minimum des codes cycliques, méthodes d'algèbre linéaire sur les corps finis.
Théorie de l'information [cs.IT]. Université Pierre et Marie Curie - Paris VI, 1993. Français
inria-00564022v1  Chapitre d'ouvrage
Daniel Augot, Michael 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-00543322v1  Communication dans un congrès
Daniel Augot. Les codes algébriques principaux et leur décodage
Jean-Guillaume Dumas and Grégoire Lecerf and Delphine Boucher; and Thomas Cluzeau. Journées Nationales de Calcul Formel, May 2010, Luminy, France. CIRM, 1, pp.31-74, 2010, Les cours du CIRM. <http://ccirm.cedram.org/ccirm-bin/fitem?id=CCIRM_2010__1_2_31_0>
...
inria-00509188v2  Communication dans un congrès
Daniel Augot, Matthieu Finiasz, Nicolas Sendrier. A Family of Fast Syndrome Based Cryptographic Hash Functions
Dwason, Ed and Vaudenay, Serge. MYCRYPT 2005 : First International Conference on Cryptology in Malaysia, Sep 2005, Kuala Lumpur, Malaysia. Springer, 3715, pp.64-83, 2003, <http://www.springerlink.com/content/1jl5wkw58a89uq4b/>. <10.1007/11554868_6>
...
inria-00509339v1  Article dans une revue
Daniel Augot, Lancelot Pecquet. A Hensel Lifting to Replace Factorization in List-Decoding of Algebraic-Geometric and Reed-Solomon Codes
Information Theory, IEEE Transactions on, IEEE Signal Processing Society, 2000, 46 (7), pp.2605 - 2614. <http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=887868>. <10.1109/18.887868>
...
inria-00509209v1  Communication dans un congrès
Daniel Augot, Alexander Zeh. On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm
Kschischang, Frank R. and Yang, En-Hui. Information Theory, 2008. ISIT 2008. IEEE International Symposium on, Jul 2008, Toronto, Canada. IEEE, pp.2620-2624, 2008, <http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4595466>. <10.1109/ISIT.2008.4595466>
...
inria-00509191v1  Communication dans un congrès
Daniel Augot, Matthieu Finiasz. A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem
Biham, Eli. EUROCRYPT 2003, May 2003, Warsaw, Poland. Srpinger, 2656, pp.229-249, 2003, Lecture Notes in Computer Science; Advances in Cryptology — EUROCRYPT 2003. <http://www.springerlink.de/content/k61v1wgre681gky9/>. <10.1007/3-540-39200-9_14>
...
inria-00509482v1  Communication dans un congrès
Daniel Augot, Franç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. IEEE, pp.43, 1994, 1994 IEEE International Symposium on Information Theory, Proceedings. <http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=394928>. <10.1109/ISIT.1994.394928>
...
inria-00509424v1  Communication dans un congrès
Daniel Augot. Newton's identities for minimum codewords of a family of alternant codes
Vijay Bhargava and Michael Pursley. 1995 IEEE International Symposium on Information Theory, Sep 1995, Whistler, Canada. IEEE, pp.349, 1995, <http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=550336>. <10.1109/ISIT.1995.550336>
...
inria-00509468v1  Communication dans un congrès
Daniel Augot. Algebraic Solutions of Newton's identities for cyclic codes
1998 Information Theory Workshop, Aug 1998, Killarney, Ireland. IEEE, pp.49, 1998, <http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=706411>. <10.1109/ITW.1998.706411>
...
inria-00509269v1  Communication dans un congrès
Daniel Augot, Magali Bardet, Jean-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. IEEE Computer Society, pp.362 - 362, 2003, <http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1228378>. <10.1109/ISIT.2003.1228378>
...
inria-00547445v1  Communication dans un congrès
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. 2010, Fascicules Journées annuelles de la SMF
...
hal-00823535v1  Communication dans un congrès
Daniel Augot, Pierre Loidreau, Gwezheneg Robert. Rank metric and Gabidulin codes in characteristic zero
ISIT 2013 IEEE International Symposium on Information Theory, Jul 2013, Istanbul, Turkey. 2013
...
medihal-01346163v1  Vidéo
Gwezheneg Robert, Daniel Augot, Pierre Loidreau, Fanny Bastien. Gwezheneg Robert - Généralisation des codes de Gabidulin à la caractéristique nulle
2014
...
hal-00643794v1  Communication dans un congrès
Daniel Augot, Morgan Barbier, Alain Couvreur. List-Decoding of Binary Goppa Codes up to the Binary Johnson Bound
Shokrollahi. Amin and da Rocha Jr., Valdemar C. and Costa, Sueli I. R. IEEE Information Theory Workshop, Oct 2011, Paraty, Brazil. IEEE, pp.229 - 233, 2011, <10.1109/ITW.2011.6089384>
...
hal-00723500v1  Article dans une revue
Daniel Augot. Description of minimum weight codewords of cyclic codes by algebraic systems
Finite Fields and Their Applications, Elsevier, 1996, pp.138-152. <10.1006/ffta.1996.0009>
...
inria-00633205v1  Article dans une revue
Alexander Zeh, Christian Gentner, Daniel 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>
...
hal-00723735v1  Article dans une revue
Daniel Augot, Nicolas Sendrier. Idempotents and the BCH bound
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 1994, 40 (1), pp.204-207. <10.1109/18.272483>
...
hal-00723733v1  Article dans une revue
Daniel Augot, Pascale Charpin, Nicolas Sendrier. Studying the Locator Polynomials of Minimum Weight Codewords of BCH Codes
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 1992, 38 (3), pp.960-973. <10.1109/18.135638>
...
inria-00509478v1  Article dans une revue
Daniel Augot, Franç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. <http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=508853>. <10.1109/18.508853>

Contact


archive-ouverte@inria.fr