Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The AAECC symposium was started in June 1983 by Alain Poli (Toulouse), who, together with R. Desq, D. Lazard, and P. Camion, organized the ?rst c- ference. The meaning of the acronym AAECC changed from “Applied Algebra and Error Correcting Codes” to “Applied Algebra, Algebraic Algorithms, and ErrorCorrectingCodes.” Onereasonwasthe increasing importance of compl- ity, particularly for decoding algorithms. During the AAECC-12 symposium the Conference Committee decided to enforce the theory and practice of the coding side as well as the cryptographic aspects. Algebra is conserved as in the past, but slightly more oriented to algebraic geometry codes, ?nite ?elds, complexity, polynomials, and graphs. For AAECC-16 the main subjects covered were: – Block codes. – Algebra and codes: rings, ?elds, AG codes. – Cryptography. – Sequences. – Algorithms, decoding algorithms. – Iterative decoding: code construction and decoding algorithms. – Algebra: constructions in algebra,Galois group, di?erential algebra, poly- mials. Four invited speakers characterize the outlines of AAECC-16: – C. Carlet (“On Bent and Highly Nonlinear Balanced/Resilient Functions and their Algebraic Immunities”). – S. Gao (“Grobner Bases and Linear Codes”). – R.J. McEliece (“On Generalized Parity Checks”). – T. Okamoto (“Cryptography Based on Bilinear Maps”).
Refereed proceedings of the 16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16Includes 25 revised full papers presented together with 7 invited papersAddresses subjects such as block codes; algebra and codes: rings, fields, and AG codes; cryptography; sequences; decoding algorithms