Daniel Augot's publications: Journal articles
Home Page

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

  1. Daniel Augot, Pascale Charpin, and Nicolas Sendrier. Studying the locator polynomial of minimum weight codewords of BCH codes. IEEE Transactions on Information Theory, 38(3):960–973, 1992. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=135638. Local copy: IEEE_IT_92.pdf.
  2. Daniel Augot, Pascale Charpin, and Nicolas Sendrier. Sur une classe de polynômes scindés de l’algèbre F2m[Z]. Comptes Rendus de l’Académie des Sciences, 312:649–751, 1991. Local copy: CRAS_91.pdf.
  3. Daniel Augot and Nicolas Sendrier. Idempotents and the BCH bound. IEEE Transactions on Information Theory, 40(1):204–207, January 1994. http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6734arnumber=272483. Local copy: IEEE_IT94.pdf.
  4. Daniel Augot. Description of minimum weight codewords of cyclic codes by algebraic systems. Finite Fields Appl., 2(2):138–152, 1996. http://dx.doi.org/10.1006/ffta.1996.0009. Local copy: FFA_96.pdf.
  5. Daniel Augot and Françoise Lévy-dit Véhel. Bounds on the minimum distance of the duals of BCH code. IEEE Transactions on Information Theory, 1996. http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=10986arnumber=508853. Local copy: IEEE_IT96.pdf.
  6. Daniel Augot and Paul Camion. Forme de Frobenius et vecteurs cycliques. Comptes rendus de l’Académie des Sciences, 318:183–188, 1993. Local copy: CRAS_94.pdf.
  7. Daniel Augot and Paul Camion. On the computation of minimal polynomials, cyclic vectors and Frobenius forms. Linear Algebra and its Applications, 260:61–94, 1997. http://dx.doi.org/10.1016/S0024-3795(97)80005-5. Local copy: LAA_96.pdf.
  8. Daniel Augot, Jean-Marc Boucqueau, Jean-François Delaigle, Caroline Fontaine, and Eddy Goray. Secure delivery of images over open networks. Proceedings of the IEEE, 87(7):2605–2614, November 1999. http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=16709arnumber=771076. Local copy: IEEE99PROC.pdf.
  9. Daniel Augot and Lancelot Pecquet. A Hensel lifting to replace factorization in list-decoding of Algebraic-Geometric and Reed-Solomon codes. IEEE Transactions on Information Theory, 46(7):2605–2614, November 2000. http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=19190arnumber=887868. Local copy: IEEE_2000.pdf.
  10. Daniel Augot, Raghav Bhaskar, Valérie Issarny, and Daniele Sacchetti. A three round authenticated group key agreement protocol for adhoc networks. Pervasive and Mobile Computing, 3(1):36–52, 2007. http://dx.doi.org/10.1016/j.pmcj.2006.07.001. Local copy: PMC2007.pdf.
  11. Daniel Augot, Magali Bardet, and Jean-Charles Faugère. On the decoding of cyclic codes with the Newton’s identities. Journal of Symbolic Computation, page : 29 pages, 2008. Special Issue on Gröbner Bases Techniques in Cryptography and Coding Theory. gbdecode.pdf. Local copy: gbdecode.pdf.
  12. Daniel Augot, Emanuele Betti, and Emmanuela Orsini. Gröbner Bases, Coding, and Cryptography, chapter An introduction to linear and cyclic codes. RISC Book Series. Springer, Heidelberg, 2009. to appear. Local copy: introcyclic-springer.pdf.
  13. Daniel Augot and Michael Stepanov. Gröbner Bases, Coding, and Cryptography, chapter A note on the generalisation of the Guruswami-Sudan list decoding algorithm to Reed-Muller codes. RISC Book Series. Springer, Heidelberg, 2009. to appear. Local copy: list-decode-RM.pdf.
Dernière modification : 03.11.2008