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.
李平, 朱士信, 开晓山. 环Fq+uFq+…+uk−1Fq上任意长度的(uλ−1)-常循环码[J]. 电子与信息学报, 2013, 35(5): 1044-1048.
Li Ping, Zhu Shi-Xin, Kai Xiao-Shan. (uλ−1)-constacyclic Codes of Arbitrary Lengths over the Ring Fq+uFq+…+uk−1Fq. , 2013, 35(5): 1044-1048.
2013, Vol. 35 
