On Repeated-Root Constacyclic Codes of Length 2^amp^r over Finite Fields
classification
💻 cs.IT
math.IT
keywords
codesconstacycliclengthcasescharacterizeconditionscyclicequivalent
read the original abstract
In this paper we investigate the structure of repeated root constacyclic codes of length $2^amp^r$ over $\mathbb{F}_{p^s}$ with $a\geq1$ and $(m,p)=1$. We characterize the codes in terms of their generator polynomials. This provides simple conditions on the existence of self-dual negacyclic codes. Further, we gave cases where the constacyclic codes are equivalent to cyclic codes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.