Repeated-Root Self-Dual Negacyclic Codes over Finite Fields  

作　　者：Xiuli LI 

机构地区：[1]School of Mathematics and Physics, Qingdao University of Science and Technology [2]College of Information Science and Engineering, Ocean University of China

出　　处：《Journal of Mathematical Research with Applications》2016年第3期275-284,共10页数学研究及应用（英文版）

基　　金：Supported by Reward Fund for Outstanding Young and Middle-Aged Scientists of Shandong Province(Grant No.BS2011DX011);Qingdao Postdoctoral Fund(Grant No.861605040007)

摘　　要：Let F_q be a finite field with q = p^m, where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length 2~ap^r over F_q, a ≥ 1.The construction of self-dual negacyclic codes of length 2~abp^r over F_q is also provided, where gcd（2, b） = gcd（b, p） = 1 and a ≥ 1.Let F_q be a finite field with q = p^m, where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length 2~ap^r over F_q, a ≥ 1.The construction of self-dual negacyclic codes of length 2~abp^r over F_q is also provided, where gcd（2, b） = gcd（b, p） = 1 and a ≥ 1.

关 键 词：codes length Root integer factorization reciprocal polynomial facts generator irreducible 

分 类 号：O156[理学—数学]