Daniel Augot's publications: Peer reviewed conference proceedings
Home Page

Journal articles Peer reviewed conference articles Peer reviewed conference proceedings Technical reports

  1. Daniel Augot, Pascale Charpin, and Nicolas Sendrier. On the minimum weight of some binary BCH codes. In IEEE Internation Symposium on Information Theory, page 7, Budapest, Hungary, 1991. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=695060.
  2. Daniel Augot. Algebraic characterization of minimum weight codewords of cyclic codes. In IEEE International Symposium on Information Theory 94, Trondheim, Norway, June 1994. http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=394925isnumber=8959punumber=3149k2dockey=394925@ieeecnfs. Local copy: IEEE94b.pdf.
  3. Daniel Augot and Françoise Lévy-dit Véhel. Bounds on the minimum distance of the duals of BCH codes. In IEEE International Symposium on Information Theory, Trondheim, Norway, 1994. http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=394928isnumber=8959punumber=3149k2dockey=394928@ieeecnfs. Local copy: IEEE94a.pdf.
  4. Daniel Augot. Newton’s identities for minimum codewords of a family of alternant codes. In IEEE International Symposium on Information Theory (ISIT 95), Whistler, Canada, 1995. http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=550336isnumber=11520punumber=4005k2dockey=550336@ieeecnfs. Local copy: ISIT95.pdf.
  5. Daniel Augot. Algebraic equations for minimum weight codewords of many codes. In International Conference on Finite Field and Applications, Glasgow, Scotland, 1995. Local copy: FFA95.pdf.
  6. Daniel Augot. Algebraic solutions of Newton’s identities for cyclic codes. In Proceedings of the 1998 Information Theory Workshop, Killarney, Irland, 1998. http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=706411isnumber=15314punumber=5724k2dockey=706411@ieeecnfs. Local copy: IEEE_ITW98.pdf.
  7. Daniel Augot. A parallel version of a special case of the Sudan decoding algorithm. In Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on, Lausanne, 2002. http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=1023358isnumber=21920punumber=7942k2dockey=1023358@ieeecnfs. Local copy: fast-rs-proceedings.pdf.
  8. Raghav Bhaskar, Daniel Augot, Cédric Adjih, Paul Mühlethaler, and Saadi Boudjit. AGDH (Asymmetric Group Diffie Hellman) an efficient and dynamic group key agreement protocol for Ad Hoc networks. In NTMS 2007, International Conference on New Technologies, Mobility and Security, 2007. Poster. AdHocGKA-NTMS07.pdf. Local copy: AdHocGKA-NTMS07.pdf.
Dernière modification : 03.11.2008