Kenza Guenda

On Repeated-Root Constacyclic Codes of Length $2^amp^r$ over Finite Fields

2015 · arXiv (Cornell University)

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 …