Enumeration of extended irreducible binary Goppa codes

发布时间：2021-09-22 作者：浏览次数：

Speaker:	陈博聪	DateTime:	2021.9.26（周日）上午9:30-10:30
Brief Introduction to Speaker: 陈博聪副教授，华南理工大学。		Place:	腾讯会议（会议号请联系胡学琴老师）
Abstract:The family of Goppa codes is one of the most interesting subclasses of algebraic geometric codes. As the McEliece cryptosystem often chooses a random Goppa code as its key, knowledge of the number of inequivalent Goppa codes for fixed parameters may facilitate in the evaluation of the security of such a cryptosystem. In this talk we present a new approach to give an upper bound on the number of inequivalent extended irreducible binary Goppa codes.This is a joint work with Guanghui Zhang.