On Repeated-Root Constacyclic Codes of Length $2^{a}m{p}^r$ over Finite Fields

Abstract

In this paper we investigate the structure of repeated root constacyclic codes of length $2^{a}m{p}^r$ over ${\mathbb{F}}_{p^s}$ with $a\ge 1$ 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.

arXiv admin note: text overlap with arXiv:1406.1848 by other authors

References in corpus (2)

• Constacyclic Codes over Finite Fields
• Self-dual Repeated Root Cyclic and Negacyclic Codes over Finite Fields