一类最小距离为4的三元最优循环码  

A Class of Ternary Optimal Cyclic Codes with Minimum Distance 4

作　　者：曾学强 何潮 

机构地区：[1]四川轻化大学数学与统计学院,四川 自贡 [2]四川职业技术学院教师教育学院,四川 遂宁

出　　处：《理论数学》2024年第8期12-19,共8页Pure Mathematics

摘　　要：循环码作为线性码的一个重要子类,具有良好的通信性质和重要的应用意义。利用有限域上因式分解、低次不可约多项式的解等数学工具,从循环码生成多项式的角度研究具有两个零点的三元循环码,得到了一类最小距离为4的三元循环码,并且它们关于Sphere-Packing界是最优的。As an important subclass of linear codes, cyclic code has good communication properties and important application significance. By using mathematical tools such as factorization over finite field, solutions of low order irreducible polynomial, ternary cyclic code with two zeros are studied from the perspective of generating polynomials of cyclic code. A class of ternary cyclic code with minimum distance of 4 is obtained, and it is optimal with respect to Sphere Packing bounds.

关 键 词：有限域 循环码 不可约多项式 最小距离 

分 类 号：O15[理学—数学]