|
|
|
| (uλ−1)-constacyclic Codes of Arbitrary Lengths over the Ring Fq+uFq+…+uk−1Fq |
| Li Ping Zhu Shi-xin Kai Xiao-shan |
| School of Mathematics, Hefei University of Technology, Hefei 230009, China |
|
|
|
|
Abstract Let R denote the ring R=Fq+uFq+…+uk−1Fq , and be an invertible element of R. By means of the theory of ring homomorphism, the generators of all these (uλ−1)-constacyclic codes of an arbitrary length N over the ring R are obtained. It is proved that R[x]<xN+1−uλ> is principal. The number of these (uλ−1)-constacyclic codes is determined. The generator polynomials of the highest-order torsion codes of all these (uλ−1)-constacyclic codes are given. As a result, the Hamming distances of all these (uλ−1)-constacyclic codes are obtained.
|
|
Received: 28 September 2012
|
|
|
|
Corresponding Authors:
Li Ping
E-mail: lpmath@126.com
|
|
|
|
|
|
|
2013, Vol. 35 
