(1-2u^k)-constacyclic codes over \mathbbF_p+u\mathbbF_p+u²\mathbbF₊u³\mathbbF_p+…+u^k\mathbbF_p

2015/12/08 by Zahid Raza, Raza, Zahid, Amrina Rana +1
Computer Science · Engineering · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1512.02332

openalex publication_date 2015/12/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let \mathbbF_p be a finite field and u be an indeterminate. This article studies (1-2u^k)-constacyclic codes over the ring R=\mathbbF_p+u\mathbbF_p+u²\mathbbF_p+u³\mathbbF_p+⋯+u^k\mathbbF_p where u^k+1=u. We illustrate the generator polynomials and investigate the structural properties of these codes via decomposition theorem.

Related

• (1-2u²)-constacyclic codes over \mathbbF_p+u\mathbbF_p+u²\mathbbF_p
• Constacyclic codes over F_q + u F_q + v F_q + u v F_q
• 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
• A class of repeated-root constacyclic codes over \mathbbF_p^m[u]/⟨ u^e⟩ of Type 2