摘要
In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m + uFp^m, where p is an odd prime. On the basis of the works of Dinh (in J.Algebra 324,940-950,2010), we use the Chinese Remainder Theorem to establish the algebraic structure of cyclic and negacyclic codes of length 2p^s over the ring Fp^m + uFp^m in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes.
In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m + uFp^m, where p is an odd prime. On the basis of the works of Dinh (in J.Algebra 324,940-950,2010), we use the Chinese Remainder Theorem to establish the algebraic structure of cyclic and negacyclic codes of length 2p^s over the ring Fp^m + uFp^m in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes.
基金
supported by the Natural ScienceFoundation of Hubei Province(D2014401)
the Natural Science Foundation of Hubei Polytechnic University(12xjz14A)