Missing open brace for subscript上的一类重根常循环码

张元婷,朱士信,王立启

系统科学与数学 ›› 2014, Vol. 34 ›› Issue (2) : 135-144.

PDF(310 KB)
PDF(310 KB)
系统科学与数学 ›› 2014, Vol. 34 ›› Issue (2) : 135-144. DOI: 10.12341/jssms12257
论文

Missing open brace for subscript上的一类重根常循环码

    张元婷1,朱士信2,王立启2
作者信息 +

 A FAMILY OF REPEATED-ROOT CONSTACYCLIC CODES OVER Missing superscript or subscript argument}

    ZHANG Yuanting1, ZHU Shixin 2, WANG Liqi2
Author information +
文章历史 +

摘要

对环Fpm+uFpm+vFpm+uvFpm上长为pe 的所有(α+uβ)-循环码进行了分类,其中u^2=0,v^2=0,uv=vu,\alpha,\beta\in\mathbb{F}^\ast_{p^m}.对于给定的\alpha,\beta,e,我们得到了该环上长为p^e的所有(\alpha+u\beta)循环码的计数公式.最后定义了这些常循环码的扭码和剩余码,并利用扭码获得了该环上长为p^e(\alpha+u\beta)$- 循环码的~Hamming 距离分布.

Abstract

In this paper, we classify all (α+βu)-cyclic codes of length pe over Fpm+uFpm+vFpm+uvFpm, where u2=0,v2=0,uv=vu,α,βFpm. For any given α,β,e, a formula for the number of these constacyclic codes is obtained. Then, the Torsion codes and Residue codes of those constacyclic codes are also defined. Finally, the Hamming distance  distribution of those constacyclic codes is given with the help of   their Torsion codes.

关键词

环上码 / 重根常循环码 / 计数公式 / Hamming 距离.

Key words

Codes over rings,  / repeated-root constacyclic codes,   / mass formula, Hamming distance.

引用本文

导出引用
张元婷,朱士信,王立启. F\bmp\bmm+\bmuF\bmp\bmm+\bmvF\bmp\bmm+\bmu\bmvF\bmp\bmm上的一类重根常循环码. 系统科学与数学, 2014, 34(2): 135-144. https://doi.org/10.12341/jssms12257
ZHANG Yuanting, ZHU Shixin , WANG Liqi.  A FAMILY OF REPEATED-ROOT CONSTACYCLIC CODES OVER F\bmp\bmm+\bmuF\bmp\bmm+\bmvF\bmp\bmm+\bmu\bmvF\bmp\bmm}. Journal of Systems Science and Mathematical Sciences, 2014, 34(2): 135-144 https://doi.org/10.12341/jssms12257
中图分类号: 94B05   
PDF(310 KB)

200

Accesses

0

Citation

Detail

段落导航
相关文章

/