Constacyclic codes of length $4p^s$ over the Galois ring $GR(p^a,m)$
Om Prakash, Habibul Islam, Ram Krishna Verma

TL;DR
This paper characterizes Type (1) λ-constacyclic codes of length 4p^s over Galois rings, detailing their structure, duals, self-orthogonality, self-duality, and distance properties, depending on whether λ is a square.
Contribution
It provides a complete structural analysis of these codes over Galois rings, including duality and distance metrics, for the first time.
Findings
Ideal decomposition when λ is a square
Chain ring structure when λ is not a square
Distance and weight distribution results
Abstract
For prime , represents the Galois ring of order and characterise , where is any positive integer. In this article, we study the Type (1) -constacyclic codes of length over the ring , where , are nonzero elements and . In first case, when is a square, we show that any ideal of is the direct sum of the ideals of and . In second, when is not a square, we show that is a chain ring whose ideals are , for where . Also, we prove the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
