Some Constacyclic Codes over Finite Chain Rings

2012/12/15 by Batoul, Aicha, Guenda, Kenza, Gulliver, T. Aaron
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1212.3704

Abstract

For λ an n-th power of a unit in a finite chain ring we prove that λ-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some constacylic codes. We also study the α+p β-constacyclic codes of length p^s over the Galois ring GR(p^e,r).

Related

• Repeated-root constacyclic codes over the finite chain ring \mathbf \mathbbF_p^m[u]/⟨ u³ ⟩
• Repeated-root constacyclic codes over finite commutative chain rings and their distances
• Some Repeated-Root Constacyclic Codes over Galois Rings
• Cyclic and Constacyclic Codes Over Z4+iZ4
• Polycyclic codes over Galois rings with applications to repeated-root\n constacyclic codes