(1-2u²)-constacyclic codes over \mathbbF_p+u\mathbbF_p+u²\mathbbF_p

2015/06/24 by Mostafanasab, Hojjat, Karimi, Negin
#11T71 #13M99 #94B05 #94B15 #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1506.07273

Abstract

Let \mathbbF_p be a finite field and u be an indeterminate. This article studies (1-2u²)-constacyclic codes over the ring \mathbbF_p+u\mathbbF_p+u²\mathbbF_p, where u³=u. We describe generator polynomials of this kind of codes and investigate the structural properties of these codes by a decomposition theorem.

Related

• (1-2u^k)-constacyclic codes over \mathbbF_p+u\mathbbF_p+u²\mathbbF₊u³\mathbbF_p+…+u^k\mathbbF_p
• Constacyclic codes over F_q + u F_q + v F_q + u v F_q
• Constacyclic Codes over F_p+vF_p
• Explicit representation for a class of Type 2 constacyclic codes over the ring \mathbbF_2^m[u]/⟨ u^2λ⟩ with even length
• Complete classification of (δ+αu²)-constacyclic codes over \mathbbF_2^m[u]/⟨ u⁴⟩ of oddly even length