Galois LCD Codes Over Fq + uFq + vFq + uvFq
Astha Agrawal, Gyanendra K. Verma, R. K. Sharma

TL;DR
This paper extends the study of Galois LCD codes from finite chain rings to a more complex non-chain ring, establishing duality correspondences, constructing LCD codes, and analyzing MDS codes over this ring.
Contribution
It generalizes Galois LCD code theory to a non-chain ring and constructs new LCD codes, providing a broader framework for code equivalence and properties.
Findings
Established a correspondence between Galois duals over the ring and its components.
Constructed Euclidean and Galois LCD codes from linear codes over the ring.
Proved that any code over the ring is equivalent to an LCD code under certain conditions.
Abstract
In \cite{anote}, Wu and Shi studied -Galois LCD codes over finite chain ring , where and for some prime and positive integer . In this work, we extend the results to the finite non chain ring , where and . We define a correspondence between -Galois dual of linear codes over and -Galois dual of its component codes over Further, we construct Euclidean LCD and -Galois LCD codes from linear code over . This consequently leads us to prove that any linear code over is equivalent to Euclidean () and -Galois LCD (, and ) code over Finally, we investigate MDS codes 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 · Islamic Finance and Communication · Cooperative Communication and Network Coding
