pith. sign in

arxiv: 1707.06133 · v2 · pith:QP34FPKRnew · submitted 2017-07-12 · 💻 cs.IT · math.AC· math.IT

A class of constacyclic codes over mathbb{F}_(p^m)[u]/left<u²right>

classification 💻 cs.IT math.ACmath.IT
keywords codesconstacyclicmathbbdeterminefiniteintegerleftlength
0
0 comments X
read the original abstract

Let $p$ be an odd prime, and let $m$ be a positive integer satisfying $p^m \equiv 3~(\text{mod }4).$ Let $\mathbb{F}_{p^m}$ be the finite field with $p^m$ elements, and let $R=\mathbb{F}_{p^m}[u]/\left<u^2\right>$ be the finite commutative chain ring with unity. In this paper, we determine all constacyclic codes of length $4p^s$ over $R$ and their dual codes, where $s$ is a positive integer. We also determine their sizes and list some isodual constacyclic codes of length $4p^s$ over $R.$

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.