2000 character limit reached
Repeated-root constacyclic codes over finite commutative chain rings and their distances
Published 20 Jun 2017 in math.AC | (1706.06269v2)
Abstract: Let $\mathcal{R}e$ be a finite commutative chain ring with nilpotency index $e \geq 2.$ In this paper, all repeated-root constacyclic codes of arbitrary lengths over $\mathcal{R}{2},$ their sizes and their dual codes are determined. As an application, some isodual constacyclic codes over $\mathcal{R}{2}$ are also listed. Moreover, Hamming distances, Rosenbloom-Tsfasman distances and Rosenbloom-Tsfasman weight distributions of all repeated-root constacyclic codes over $\mathcal{R}{2}$ and some repeated-root constacyclic codes over $\mathcal{R}_{e}$ are determined.
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.