vix.ing · top · new · best · stats · spec

Primitive Idempotents and Constacyclic Codes over Finite Chain Rings

2019/08/16 by Charkani, Mohammed Elhassani, Kabore, Joël · 1 citation
#16P10 #94B05 #94B60 #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Rings and Algebras (math.RA)

paper · doi:10.48550/arxiv.1908.07368

Abstract

Let R be a commutative local finite ring. In this paper, we construct the complete set of pairwise orthogonal primitive idempotents of R[X]/ where g is a regular polynomial in R[X]. We use this set to decompose the ring R[X]/ and to give the structure of constacyclic codes over finite chain rings. This allows us to describe generators of the dual code C^\bot of a constacyclic code C and to characterize non-trivial self-dual constacyclic codes over finite chain rings.

Cited by

Related