# 2021年6月16日学术报告——李成举

李成举，理学博士，华东师范大学教授，美国数学会《数学评论》评论员。2014年在南京航空航天大学获得博士学位，曾在香港、韩国、新加坡、法国做博士后或访问学者。20169月至今在华东师范大学工作，研究方向为编码密码相关课题，迄今在ITDCCFFASCI期刊发表论文35篇，含ESI高被引论文1篇。2017年和2018年分别入选上海市扬帆人才计划和上海市晨光人才计划。主持国家自然科学基金青年项目和面上项目各1项。

In this talk, we will employ the defining sets of cyclic codes to present two general characterizations of the hulls that have dimension $k-1$ or $k^\perp-1$,where $k^\perp$ is the dimension of the dual code $\mathcal C^\perp$. Several sufficient and necessary conditions for primitive and projective BCH codes to have $(k-1)$-dimensional (or $(k^\perp-1)$-dimensional) hulls are also developed by presenting lower and upper bounds on their designed distances. Furthermore, several classes of self-orthogonal codes are proposed via the hulls of BCH codes and their parameters are also investigated.