2000 character limit reached
Repeated-root constacyclic codes over the finite chain ring $\mathbf{ \mathbb{F}_{p^m}[u]/\langle u^3 \rangle }$
Published 20 Jun 2017 in math.NT | (1706.08869v2)
Abstract: Let $\mathcal{R}=\mathbb{F}{pm}[u]/\langle u3 \rangle $ be the finite commutative chain ring with unity, where $p$ is a prime, $m$ is a positive integer and $\mathbb{F}{pm}$ is the finite field with $pm$ elements. In this paper, we determine all repeated-root constacyclic codes of arbitrary lengths over $\mathcal{R},$ their sizes and their dual codes. As an application, we list some isodual constacyclic codes over $\mathcal{R}.$ We also determine Hamming distances, RT distances, and RT weight distributions of some repeated-root constacyclic codes over $\mathcal{R}.$
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.