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

Aicha Batoul; Kenza Guenda; T. Aaron Gulliver

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

Information Theory 2015-05-05 v1 math.IT

Authors: Aicha Batoul , Kenza Guenda , T. Aaron Gulliver

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.

Keywords

constacyclic codes repeated-root codes finite fields generator polynomials self-dual negacyclic codes cyclic codes code equivalence

Cite

@article{arxiv.1505.00356,
  title  = {On Repeated-Root Constacyclic Codes of Length $2^amp^r$ over Finite Fields},
  author = {Aicha Batoul and Kenza Guenda and T. Aaron Gulliver},
  journal= {arXiv preprint arXiv:1505.00356},
  year   = {2015}
}

Comments

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

Related papers

View all related →