Cyclic codes over of F2m[u]/⟨uk⟩ Moddly even length

被引:0
作者
Cao, Yonglin [1 ]
Cao, Yuan [2 ]
Fu, Fang-Wei [3 ,4 ]
机构
[1] Shandong Univ Technol, Sch Sci, Zibo 255091, Shandong, Peoples R China
[2] Hunan Univ, Coll Math & Econometr, Changsha 410082, Hunan, Peoples R China
[3] Nankai Univ, Chern Inst Math, Tianjin 300071, Peoples R China
[4] Nankai Univ, LPMC, Tianjin 300071, Peoples R China
基金
中国国家自然科学基金;
关键词
Cyclic code; Finite chain ring; Non-principal ideal ring; Dual code; Self-dual code; SELF-DUAL CODES; RINGS;
D O I
10.1007/s00200-015-0281-4
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Let be a finite field of characteristic 2 and () where satisfies . For any odd positive integer n, it is known that cyclic codes over R of length 2n are identified with ideals of the ring . In this paper, an explicit representation for each cyclic code over R of length 2n is provided and a formula to count the number of codewords in each code is given. Then a formula to calculate the number of cyclic codes over R of length 2n is obtained. Moreover, the dual code of each cyclic code and self-dual cyclic codes over R of length 2n are investigated.
引用
收藏
页码:259 / 277
页数:19
相关论文
共 8 条