Repeated-root constacyclic codes over the finite chain ring Fpm[u]/ u3

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…