Applied algebra, algebraic algorithms, and error-correcting codes

TheAAECCsymposiumwasstartedinJune1983byAlainPoli(Toulouse),who, together with Roger Desq, Daniel Lazard, and Paul Camion, organized the ?rst conference. The meaning of the acronym AAECC changed from “Applied - gebra and Error Correcting Codes” to “Applied Algebra, Algebraic Algorithms, and Error Correcting Codes.” One reason for this was the increasing importance of complexity, particularly for decoding algorithms. During the AAECC-12 s- posium the conference committee decided to enforce the theory and practice of the coding side as well as the cryptographic aspects. Algebra was conserved, as in the past, but was slightly more oriented to algebraic geometry codes, ?nite ?elds, complexity, polynomials, and graphs. For AAECC-15 the main subjects covered were: – Block codes. – Algebra and codes: rings, ?elds, AG codes. – Cryptography. – Sequences. – Algorithms, decoding algorithms. – Algebra: constructions in algebra, Galois groups, di?erential algebra, po- nomials. The talks of the six invited speakers characterized the aims of AAECC-15: – P. Sole (“Public Key Cryptosystems Based on Rings”). – S. Lin (“Combinatorics Low Density Parity Check Codes”). – J. Stern (“Cryptography and the Methodology of Provable Security”). – D. Costello (“Graph-Based Convolutional LDPC Codes”). – I. Shparlinsky (“Dynamical Systems Generated by Rational Functions”). – A. Lauder (“Algorithms for Multivariate Polynomials over Finite Fields”).