Galois LCD codes over mixed alphabets
Maryam Bajalan, Alexandre Fotue-Tabue, Jo\"el Kabore, Edgar, Mart\'inez-Moro

TL;DR
This paper characterizes Galois linear complementary dual codes over mixed alphabets from finite chain rings and explores their Gray images, expanding understanding of their structure and invariance properties.
Contribution
It provides a characterization of Galois LCD codes over mixed alphabets and analyzes their Gray images, introducing new insights into their structure and invariance.
Findings
Characterization of Galois LCD codes over mixed alphabets
Conditions for Galois invariance of these codes
Analysis of Gray images leading to new LCD codes
Abstract
We study (Galois) linear complementary dual codes over mixed alphabets arising from finite chain rings. We give a characterization of when a given code is of We study (Galois) linear complementary dual codes over mixed alphabets arising from finite chain rings. We give a characterization of when a given code is of this type and when it is Galois invariant. Finally, this leads to a study of the Gray image of -linear codes, where and , that provides -linear complementary dual codes.
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 · Cellular Automata and Applications · graph theory and CDMA systems
