News Home > content

New Constructions of MDS Euclidean Self-Dual Codes

Release date : May 20, 2020 office viewed :

Speaker: Fu Fangwei received his bachelor's degree, master's degree and doctor's degree in Science (Mathematics) from Nankai University in 1984, 1987 and 1990 respectively. Since July 1987, he has worked in the School of Mathematical Sciences of Nankai University. He is now a professor and doctoral supervisor of Chern Institute of mathematics, Nankai University, vice chairman of information theory branch of Chinese Institute of Electronics, director of Chinese Association for Cryptologic Research, vice chairman of mathematical theory Committee of cryptography of Chinese Association for Cryptologic Research, editorial board member of Journal of Cryptologic Research and Journal of Electronics and Information Technology. He was selected into the trans century talents training plan of the Ministry of Education in 2000. In the same year, he received Special government allowances of the State Council. He is mainly engaged in coding theory and its application, cryptography and its application, information theory and its application, and has published more than 200 papers in international and domestic important academic journals and international conference collections. As the person in charge, he has undertaken many scientific research projects of NSFC and Ministry of Education. As the project leader, he has undertaken the 973 project of the Ministry of Science and Technology and project of National Key R&D Program of China.

Date: May 22, 2020

Time: 15:00-16:00

Location: Welcome to ZOOM meeting, https://zoom.com.cn/j/2936654514



Abstract:

In this paper, we consider the problem for which lengths an MDS Euclidean self-dual code over {F}_{q} exists. This problem is completely solved for the case where q is even. For q is odd, some q-ary MDS Euclidean self-dual codes were obtained in the literature. In the present paper, we construct new classes of q-ary MDS Euclidean self-dual codes by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes. Finally, we talk some recent progress and future research problems on this topic.


Inviter: Wen Jiejing

Edited by: Xu Zeyu