A class of constacyclic codes over \mathbbF_p^m[u]/

2017/07/12 by Sharma, Anuradha, Rani, Saroj
#94B15 #Commutative Algebra (math.AC) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1707.06133

Abstract

Let p be an odd prime, and let m be a positive integer satisfying p^m ≡ 3~(mod 4). Let \mathbbF_p^m be the finite field with p^m elements, and let R=\mathbbF_p^m[u]/ 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.

Related

• Repeated-root constacyclic codes over the finite chain ring \mathbf \mathbbF_p^m[u]/⟨ u³ ⟩
• On a class of (δ+αu²)-constacyclic codes over \mathbbF_q[u]/⟨ u⁴⟩
• A class of repeated-root constacyclic codes over \mathbbF_p^m[u]/⟨ u^e⟩ of Type 2
• On (α+uβ)-constacyclic codes of length p^sn over \mathbbF_p^m+u\mathbbF_p^m
• Complete classification of (δ+αu²)-constacyclic codes over \mathbbF_2^m[u]/⟨ u⁴⟩ of oddly even length