21st International Conference on Applications of Computer Algebra (ACA 2015)
Posté le 20/07/2015
Call for Participation
The session will cover general technical aspects of finite fields and their applications in communications, cryptography, coding theory and combinatory.
The aim of this session is to bring together researchers from several aspects of finite fields: computation and applications. Topics of interest include, but are not limited to: Computational aspects of finite fields: algorithms and complexity, polynomial factorization, decomposition and irreducibility testing, estimation and computation character sums, finding primitive and other special elements of finite fields, algorithms for polynomials, curves, varieties, sequences and functions over finite fields, Grobner Basis.
Applications: cryptography, codes, finite geometry, information theory, combinatory, designs and configurations, quantum information science. Emphasis will be placed on mathematics methods and algorithmic tools related to these areas, such as: Boolean functions, codes, sequences, finite fields, algebraic systems and related polynomial properties and Grobner basis. The lectures allow to enhance the capacities of young researchers in the areas of discrete mathematics and their applications.
Organizers
Kenza Guenda ATN, Faculty of Mathematics, USTHB, Algeria ken.guenda@gmail.com Ilias Kotsireas Department of Physics & Computer Science, Wilfrid Laurier University, Canada ikotsireas@wlu.ca Sihem Mesnager LAGA, Department of Mathematics, Paris 8 University, and Telecom ParisTech France smesnager@univ-paris8.fr
Submission should be sent to the sessions organizers following the ACA 2015 guidelines.