Skew Constacyclic Codes over Finite Chain Rings
Somphong Jitman, San Ling, Patanee Udomkavanich

TL;DR
This paper extends the theory of skew constacyclic codes to finite chain rings, characterizing their structure, duals, and self-duality conditions, with explicit examples over specific rings.
Contribution
It introduces a comprehensive framework for skew constacyclic codes over finite chain rings, including duals and self-duality, expanding prior work from finite fields and Galois rings.
Findings
Complete structure of skew constacyclic codes over finite chain rings
Explicit formulas for dual and self-dual codes
Illustrative example over +u showing code properties
Abstract
Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right divisors of , where is a unit element, are exhibited. When , the generators of Euclidean and Hermitian dual codes of such codes are determined together with necessary and sufficient conditions for them to be Euclidean and Hermitian self-dual. Of more interest are codes over the ring . The structure of all skew constacyclic codes is completely determined. This allows us to express generators of Euclidean and Hermitian dual codes of skew cyclic and skew negacyclic codes in terms of the generators of the original codes. An illustration of all skew cyclic codes of length~2 over…
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 · Quantum-Dot Cellular Automata
