Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 12 Jul 2017 in cs.IT, math.AC, and math.IT

Abstract: Let $p$ be an odd prime, and let $m$ be a positive integer satisfying $pm \equiv 3~(\text{mod }4).$ Let $\mathbb{F}{pm}$ be the finite field with $pm$ elements, and let $R=\mathbb{F}{pm}[u]/\left<u^2\right>$ be the finite commutative chain ring with unity. In this paper, we determine all constacyclic codes of length $4ps$ 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 $4ps$ over $R.$

Citations (1)

Summary

We haven't generated a summary for this paper yet.