Cyclic and negacyclic codes of length 2ps over pm+ upm

In this article, we focus on cyclic and negacyclic codes of length 2ps over the ring R = pm+ upm, 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 2ps over the ring pm+ upm in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes.