English

Repeated-root constacyclic codes over the finite chain ring $\mathbf{ \mathbb{F}_{p^m}[u]/\langle u^3 \rangle }$

Number Theory 2017-09-25 v2

Abstract

Let R=Fpm[u]/u3\mathcal{R}=\mathbb{F}_{p^m}[u]/\langle u^3 \rangle be the finite commutative chain ring with unity, where pp is a prime, mm is a positive integer and Fpm\mathbb{F}_{p^m} is the finite field with pmp^m elements. In this paper, we determine all repeated-root constacyclic codes of arbitrary lengths over R,\mathcal{R}, their sizes and their dual codes. As an application, we list some isodual constacyclic codes over R.\mathcal{R}. We also determine Hamming distances, RT distances, and RT weight distributions of some repeated-root constacyclic codes over R.\mathcal{R}.

Keywords

Cite

@article{arxiv.1706.08869,
  title  = {Repeated-root constacyclic codes over the finite chain ring $\mathbf{ \mathbb{F}_{p^m}[u]/\langle u^3 \rangle }$},
  author = {Anuradha Sharma and Tania Sidana},
  journal= {arXiv preprint arXiv:1706.08869},
  year   = {2017}
}

Comments

arXiv admin note: text overlap with arXiv:1706.06269

R2 v1 2026-06-22T20:31:08.026Z