| CYCLIC AND NEGACYCLIC CODES OF LENGTH 2p^s OVER Fp^m ＋ uFp^m |
| |
| 引用本文： | 刘修生,许小芳.CYCLIC AND NEGACYCLIC CODES OF LENGTH 2p^s OVER Fp^m ＋ uFp^m[J].数学物理学报(B辑英文版),2014(3):829-839. |
| |
| 作者姓名： | 刘修生 许小芳 |
| |
| 基金项目： | The author is supported by the Natural Science Foundation of Hubei Province （D2014401） and the Natural Science Foundation of Htibei Polytechnic University （12xjz14A）. |
| |
| 摘 要： | 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.
|
| 关 键 词： | 负循环码 环和 中国剩余定理 代数结构 奇素数 发生器 多项式 长度 |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
