Linear complementary pair of group codes over finite principal ideal rings
Hualu Liu, Xiusheng Liu

TL;DR
This paper characterizes linear complementary pairs of group codes over finite principal ideal rings and shows their permutation equivalence with dual codes.
Contribution
It provides a necessary and sufficient condition for a pair of group codes to be LCP over group algebras of finite principal ideal rings.
Findings
Characterization of LCP pairs over finite principal ideal rings.
Proof that group codes and their duals are permutation equivalent.
Establishment of conditions for code complementarity over group algebras.
Abstract
A pair of group codes over group algebra is called a linear complementary pair (LCP) if , where is a finite principal ideal ring, and is a finite group. We provide a necessary and sufficient condition for a pair of group codes over group algebra to be LCP. Then we prove that if and are both group codes over , then and are permutation equivalent.
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 · Cooperative Communication and Network Coding · graph theory and CDMA systems
