编码密码学术活动月系列活动二

题目：A bound on the minimum distance of generalized quasi-twisted codes

报告人：高健副教授 （山东理工大学）

Abstract：

Generalized quasi-twisted (GQT) codes form a generalization of quasi-twisted (QT) codes and generalized quasi-cyclic (GQC) codes. By the Chinese remainder theorem, the GQT codes can be decomposed into a direct sum of some linear codes over Galois extension fields, which leads to the trace representation of the GQT codes. Using this trace representation, we first prove the minimum distance bound for GQT codes with two constituents. Then we generalize the result to GQT codes with s constituents. Finally, we present some examples to show that the bound is better than the well-known Esmaeili-Yari bound and sharp in many instances.

时间：2020年10月7日（周三） 下午16:00-17:00

地点：线上腾讯会议（会议号：812 998 799）

联系人：张俊

主办单位：565net必赢客户端565net必赢客户端

                 565net必赢客户端交叉科学研究院