| Repeated-Root Self-Dual Negacyclic Codes over Finite Fields |
| Received:May 05, 2015 Revised:January 13, 2016 |
| Key Words:
constacyclic codes negacyclic codes self-dual codes generator polynomials
|
| Fund Project:Supported by Reward Fund for Outstanding Young and Middle-Aged Scientists of Shandong Province (Grant No.BS2011DX011) and Qingdao Postdoctoral Fund (Grant No.861605040007). |
|
| Hits: 2632 |
| Download times: 2345 |
| 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$. |
| Citation: |
| DOI:10.3770/j.issn:2095-2651.2016.03.004 |
| View Full Text View/Add Comment |
