有限链环上的广义拟循环码  

On Generalized Quasi-Cyclic Codes over Finite Chain Rings

作　　者：崔梦瑶 高健 马芳卉 孟祥蕊 CUI Mengyao;GAO Jian;MA Fanghui;MENG Xiangrui(School of Mathematics and Statistics,Shandong University of Technology,Zibo 255000)

机构地区：[1]山东理工大学数学与统计学院,淄博255000

出　　处：《系统科学与数学》2022年第11期3134-3148,共15页Journal of Systems Science and Mathematical Sciences

基　　金：山东省自然科学基金(ZR2022MA024);山东省自然科学基金(ZR2021QA047);国家自然科学基金(12071264,11701336,11626144,11671235);山东省高等学校“青创人才引育计划”资助课题。

摘　　要：有限链环上一般指标广义拟循环码的显式生成元对于确定广义拟循环码的生成矩阵、对偶码、计数、最小距离、对偶包含的条件、重量分布具有重要意义.设有限链环R=F_(q)+uF_(q)+…+u^(s-1)F_(q),其中q是某个素数的幂次,s是正整数,s≥2和u^(s)=0.环R上分块码长为(r_(1),r_(2),…,r_(1)),指标为l的广义拟循环码是R[x]/<x^(r_(1))-1>×R[x]/<x^(r_(2))-1>×…×R[x]/<x^(r_(l))-1>的R[x]-子模.文章确定了有限链环R上一般指标广义拟循环码的生成元、极小生成元集以及广义拟循环码与对偶码之间生成元的关系.Explicit generators of generalized quasi-cyclic(GQC) codes of general index over the finite chain ring are of great significance for determining the generator matrix,the duality,the enumeration,the minimum distance bound,the hull and the weight distribution of GQC codes.Let R=F_(q)+uF_(q)+…+u^(s-1)F_(q),where q is a prime power,s is a positive integer,s≥2 and u^(s)=0.A GQC code of block lengths(r_(1),r_(2),…,r_(l)) with index l over R can be viewed as an R[x]-submodule of R[x]/ x R[x]/{x^(r_(2))-1) ×…×R[x]/(x^(r_(l))-1>.In this paper,we determine the generators and the minimum generating sets of GQC codes with general index over the finite chain ring R.We also determine the relationship of generators between GQC codes and their dual codes.

关 键 词：广义拟循环码 生成元 极小生成元集 对偶码 

分 类 号：O157.4[理学—数学]