主题：Codes from bent functions over finite fields
主讲：Sihem Mesnager Professor, the University of Paris VIII
Sihem Mesnager received the Ph.D. degree in Mathematics from the University of Pierre et Marie Curie (Paris VI), Paris, France, in 2002 and the Habilitation to Direct Theses (HDR) in Mathematics from the University of Paris VIII, France, in 2012. Currently, she is an associate Professor in Mathematics at the University of Paris VIII ( France) in the laboratory LAGA (Laboratory of Analysis, Geometry and Applications), University of Paris XIII and CNRS. She is also Professor adjoint to Telecom ParisTech (France), research group MIC2 in mathematics of the department INFERES, Telecom ParisTech (ex. National high school of telecommunications). Her research interests include discrete Mathematics, Boolean functions, Cryptology, Coding theory, Commutative Algebra and Computational Algebraic Geometry. She is Editor in Chief of the International Journal of Information and Coding Theory (IJOCT) and an Associate Editor for the international journal IEEE TRANSACTIONS ON INFORMATION THEORY (IEEE-IT). She also serves the editorial board of the international journal Advances in Mathematics of Communications (AMC), the international journal Cryptography and Communications Discrete Structures, Boolean Functions and Sequences (CCDS) and the international journal RAIRO ITA (Theoretical Informatics and Applications). She was a program co-chair for International Workshop on the Arithmetic of Finite Fields (WAIFI) in 2014 and International Conference on coding and Cryptography (ICCC) in 2015 and served on the board of program comitties of several international conferences and workshops (Africacrypt 2009, SETA 2010, SETA 2014, WCC 2011, WCC 2013, WCC 2015, International Workshop Castle Meeting on Coding Theory and Applications in 2014, ICCC 2015, ACA 2015, WAIFI 2016, SETA 2016, ICCA 2016, etc.). She is (co)-author for more than 65 articles, 2 books and gave approx. 65 national and international conferences. Since 2013, she is vice-president of the french Chapter of IEEE in information theory.
报告简介： It is well-known that Kerdock codes are constructed from bent functions. Very recently, some authors have highlighted that bent functions lead to the construction of interesting linear codes (in particular, linear codes with few weights). This talk is devoted to linear codes from bent functions and other plateaued functions. We shall present the state of the art as well as our recent contributions in this topic. We will present two generic constructions of linear codes involving special functions and investigate constructions of good linear codes based on the generic constructions involving bent functions over finite fields. More specifically, we shall give more details on our recent (2016) results on linear codes with few weights from weakly regular bent functions based on a generic construction.