数学学科Seminar第2218讲 $\Z_2\Z_4$-Additive Quasi-Cyclic codes

创建时间:  2021/11/29  龚惠英   浏览次数:   返回

报告题目 (Title):$\Z_2\Z_4$-Additive Quasi-Cyclic codes

报告人 (Speaker):施敏加 教授(安徽大学)

报告时间 (Time):2021年12月2日(周四) 13:00

报告地点 (Place):腾讯会议 861 347 722

邀请人(Inviter):丁洋

主办部门:理学院数学系

报告摘要:We study the codes of the title by the CRT method, that decomposes such codes into constituent codes, which are shorter codes over larger alphabets. Criteria on these constituent codes for self-duality and linear complementary duality of the decomposed codes are derived. The special class of the one-generator codes is given a polynomial representation and exactly enumerated. In particular, we present some illustrative examples of binary linear codes derived from the $\Z_2\Z_4$-additive quasi-cyclic codes that meet the Griesmer bound with equality.

上一条:数学学科Seminar第2219讲 Some Contructions on the Communication Efficient Secret Sharing

下一条:数学学科Seminar第2217讲 Drinfel'd--Sokolov 方程族的可积(半)离散


数学学科Seminar第2218讲 $\Z_2\Z_4$-Additive Quasi-Cyclic codes

创建时间:  2021/11/29  龚惠英   浏览次数:   返回

报告题目 (Title):$\Z_2\Z_4$-Additive Quasi-Cyclic codes

报告人 (Speaker):施敏加 教授(安徽大学)

报告时间 (Time):2021年12月2日(周四) 13:00

报告地点 (Place):腾讯会议 861 347 722

邀请人(Inviter):丁洋

主办部门:理学院数学系

报告摘要:We study the codes of the title by the CRT method, that decomposes such codes into constituent codes, which are shorter codes over larger alphabets. Criteria on these constituent codes for self-duality and linear complementary duality of the decomposed codes are derived. The special class of the one-generator codes is given a polynomial representation and exactly enumerated. In particular, we present some illustrative examples of binary linear codes derived from the $\Z_2\Z_4$-additive quasi-cyclic codes that meet the Griesmer bound with equality.

上一条:数学学科Seminar第2219讲 Some Contructions on the Communication Efficient Secret Sharing

下一条:数学学科Seminar第2217讲 Drinfel'd--Sokolov 方程族的可积(半)离散