Repeated Root Constacyclic Codes of Length mp^s over \mathbbF_p^r+u \mathbbF_p^r+...+ u^e-1\mathbbF_p^r

2012/11/30 by Kenza Guenda, Guenda, Kenza, T. Aaron Gulliver +1
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #FOS: Computer and information sciences #Finite Group Theory Research #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT

paper · pdf · doi:10.48550/arxiv.1211.7326

arxiv created 2012/11/30 · openalex publication_date 2012/11/30 · arxiv updated 2012/12/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We give the structure of λ-constacyclic codes of length p^sm over R=\mathbbF_p^r+u \mathbbF_p^r+...+ u^e-1\mathbbF_p^r with λ∈ \F_p^r^*. We also give the structure of λ-constacyclic codes of length p^sm with λ=α₁+uα₂+...+u^e-1 α_e-1, where α₁,α₂ ≠ 0 and study the self-duality of these codes.

Related

• Constacyclic codes of length p^sn over \mathbbF_p^m+u\mathbbF_p^m
• A note on complete classification of (δ+αu²)-constacyclic codes of length p^k over \F_p^m+u\F_p^m+u²\F_p^m
• On Repeated-Root Constacyclic Codes of Length 2^amp^r over Finite Fields
• Repeated-root constacyclic codes of length 2ℓ^mpⁿ
• A class of repeated-root constacyclic codes over \mathbbF_p^m[u]/⟨ u^e⟩ of Type 2