Relative projective group codes over chain rings
Simon Eisenbarth, Sihuang Hu

TL;DR
This paper characterizes relative projective group codes over chain rings, establishing a bijection with chains of projective codes over the residue field, and derives properties like duals and weight bounds.
Contribution
It provides a structure theorem linking relative projective codes over chain rings to chains of codes over the residue field, enabling new code constructions.
Findings
Bijection between relative projective codes and chains of codes over the residue field
Method to construct dual codes from chains
Derived bounds on minimum Hamming and Euclidean weights
Abstract
A structure theorem of the group codes which are relative projective for the subgroup of is given. With this, we show that all such relative projective group codes in a fixed group algebra are in bijection to the chains of projective group codes of length in the group algebra , where is the residue field of . We use a given chain to construct the dual code in and also derive the minimum Hamming weight as well as a lower bound of the minimum euclidean weight.
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
