研究了有限链环R=Zp^s上长为mn准循环码,其中,p是素数,S是任意的正整数.通过对其结构的研究,确定了R上长为mn准循环码等价于A^n的A子模,其中,A=R[x]/(x^m-1).然后,研究了以下情形:当gcd(m,p)=1时,R上准循环码可以分解成有限个不可约循环子模的直和.
The quasi cyclic codes of length znn over R:Zps were studied, where p is a p 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 A^n, 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.