11月30日-12月1日：编码密码与安全系列报告

In this talk, we give a characterization of abelian Cayley graphs having uniform mixing. Some concrete constructions of such graphs are provided.

The generalized Hamming weights are fundamental parameters of linear codes. In this talk, the generalized Hamming weights of two classes of linear codes constructed from defining sets are determined.

1988、1991 年于北京大学数学系获得学士、硕士学位，1994 年在中科院系统科学研究所应用数学专业获得博士学位，入选2001 年度中国科学院“百人计划”。现为中国科学院信息工程研究所研究员、博士生导师。主要从事编码理论和密码学研究，先后主持了9 个国家级科研项目，包括国家自然科学基金、国家863 计划、国家密码发展基金等项目，2002、2009年分获国家密码科技进步奖励二等奖（排名第二）和一等奖（排名第五）。

In this talk, we discuss the symbol-pair weight distributions of MDS codes and simplex codes over finite fields. Furthermore, the result shows that all the nonzero codewords of simplex codes have the same symbol b-weight and rearrangement of coordinates in simplex codes may induce different symbol-pair weight. In addition, the symbol b-weight distributions of variation simplex codes over certain finite fields are derived.

Locally repairing codes are used to correct errors in distributed networks. Constructing optima locally repairing codes is challenging. In this talk, we present an algebraic construction of optimal locally repairing codes via projective and elliptic curves.

In this talk, a class of binary sequences with two-valued cross correlations and a class of ternary sequences with at most three-valued cross correlations are presented.

www.sei.ecnu.edu.cn Copyright Software Engineering Institute