中国科学技术大学学报 ›› 2013, Vol. 43 ›› Issue (8): 622-625.DOI: 10.3969/j.issn.0253-2778.2013.08.003
• 原创论文 • 上一篇 下一篇
储 强
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
作者简介:
基金资助:
CHU Qiang
Received:
Revised:
Online:
Published:
摘要： 研究了有限链环R=Zps上长为mn准循环码，其中，p是素数，s是任意的正整数.通过对其结构的研究，确定了R上长为mn准循环码等价于An的A子模,其中，A=R［x］/(xm－1).然后，研究了以下情形：当gcd(m,p)=1时,R上准循环码可以分解成有限个不可约循环子模的直和.
关键词: 准循环码, 不可约模, 子模, 直和
Abstract: The quasi-cyclic codes of length mn over R=Zps were studied, where p is a prime and s is an arbitrary positive integer. By exploring the structure, the quasi-cyclic codes of length mn over R were shown to be equivalent to A-submodules of An, where A=R［x］/(xm－1). Then the case was studied in which quasi-cyclic codes over R can be decomposed into a direct sum of a fixed number of irreducible cyclic submodules when gcd(m,p)=1.
Key words: quasi-cyclic codes, irreducible modules, cyclic modules, direct sum
储 强，朱士信. Zps 上的准循环码[J]. 中国科学技术大学学报, 2013, 43(8): 622-625.
CHU Qiang, ZHU Shixin. Quasi-cyclic codes over Zps [J]. Journal of University of Science and Technology of China, 2013, 43(8): 622-625.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://just-cn.ustc.edu.cn/CN/10.3969/j.issn.0253-2778.2013.08.003
http://just-cn.ustc.edu.cn/CN/Y2013/V43/I8/622
