首页 | 本学科首页   官方微博 | 高级检索  
     检索      

有限域上的重根自对偶负循环码
引用本文:李秀丽.有限域上的重根自对偶负循环码[J].数学研究及应用,2016,36(3):275-284.
作者姓名:李秀丽
作者单位:青岛科技大学数理学院, 山东 青岛 266000; 中国海洋大学信息科学与工程学院, 山东 青岛 266000
基金项目:山东省中青年科学家奖励基金(Grant No.BS2011DX011),青岛市博士后基金(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.

关 键 词:常循环码    负循环码    自对偶码    生成多项式
收稿时间:5/5/2015 12:00:00 AM
修稿时间:2016/1/13 0:00:00

Repeated-Root Self-Dual Negacyclic Codes over Finite Fields
Xiuli LI.Repeated-Root Self-Dual Negacyclic Codes over Finite Fields[J].Journal of Mathematical Research with Applications,2016,36(3):275-284.
Authors:Xiuli LI
Institution:School of Mathematics and Physics, Qingdao University of Science and Technology, Shandong 266000, P. R. China; College of Information Science and Engineering, Ocean University of China, Shandong 266000, P. R. China
Abstract: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 $F_{q}$. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length $2^{a}p^{r}$ over $F_{q}$, $a\geq1$. The construction of self-dual negacyclic codes of length $2^{a}bp^{r}$ over $F_{q}$ is also provided, where ${\rm gcd}(2,b)={\rm gcd}(b,p)=1$ and $a\geq1$.
Keywords:constacyclic codes  negacyclic codes  self-dual codes  generator polynomials
本文献已被 CNKI 等数据库收录!
点击此处可从《数学研究及应用》浏览原始摘要信息
点击此处可从《数学研究及应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号