报告题目： Galois Geometries and Coding Theory
报告人： Prof. Ivan Landjev
报告时间： 2009年5月8日（星期五）下午2:00～
报告地点： 玉泉校区 信电系大楼215房间
欢迎广大师生踊跃参加！
Abstract: The geometric nature of certain optimality problems in coding theory has been long known. The connection between the geometry of special pointsets in suitably chosen projective and affine spaces and linear codes over certain algebraic structures (finite fields, semifields, special rings) has been exploited repeatedly during the years.
In the last decade, a substantial progress has been made in the fields of finite geometry and coding theory. Yet many challenging problems remain unsolved. The goal of this talk is to state some of the basic results in both areas, to survey the recent advances and to formulate some interesting (in our view) open problems.
Biography: Ivan N. Landjev is currently professor for Mathematics at the Department of Informatics, New Bulgarian University, and at the Institute of Mathematics and Informatics, Bulgarian Academy of Sciences (BAS), both in Sofia, Bulgaria. He received the Ph.D. degree from Sofia University in 1990 and the Doctor of Sciences from the Institute of Mathematics and Informatics, BAS, in 2000. Since 1991 he has held several visiting positions at TU Muenchen, University of Salford, and Michigan Technological University. His research interests include coding theory, finite geometries, combinatorics, and cryptology.