English

Primitive Idempotents and Constacyclic Codes over Finite Chain Rings

Information Theory 2019-08-21 v1 math.IT Rings and Algebras

Abstract

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

Keywords

Cite

@article{arxiv.1908.07368,
  title  = {Primitive Idempotents and Constacyclic Codes over Finite Chain Rings},
  author = {Mohammed Elhassani Charkani and Joël Kabore},
  journal= {arXiv preprint arXiv:1908.07368},
  year   = {2019}
}
R2 v1 2026-06-23T10:52:11.289Z