科学研究

Scientific Research

当前位置: 首页 > 科学研究 > 学术报告 > 数苑经纬讲坛 > 正文

数苑经纬讲坛(61):Dual-Containing Cyclic Codes over $GR(4,m)$ of Length $2^k$

来源:
|
发布时间:2025-12-15
报告时间:
2025年12月16日(周二)下午14:30-15:30
报告地点:
国交三号楼C501教室
报告人:
Youcef Maouche
报告人单位:
胡阿里·布迈丁科技大学
邀请人:
刘宏伟
摘要:
In this presentation, we study dual-containing cyclic code of length $2^k$ over the Galois ring $GR(2,m)$. In particular, necessary and sufficient conditions for the existing of dual-containing codes are obtained. Using properties for Kronecker products of matrices of a specific type and column vectors of these matrices, we give a simple and efficient method to construct all these dual-containing cyclic codes precisely.

Youcef Maouche (胡阿里·布迈丁科技大学)