A Note on Subgroup Perfect Codes in Cayley Graphs
Li Jingjian, Li Binbin, Liu Xianglin

TL;DR
This paper establishes a precise criterion for when subgroups form perfect codes in finite groups and applies this to classify such codes in extraspecial 2-groups and related groups.
Contribution
It provides a necessary and sufficient condition for subgroup perfect codes in finite groups and classifies them in specific classes of groups, advancing understanding of algebraic coding theory.
Findings
Characterization of subgroup perfect codes in finite groups
Complete classification in extraspecial 2-groups
Identification of perfect codes in groups with extraspecial Sylow 2-subgroups
Abstract
In this paper, we give a necessary and sufficient condition for a subgroup to be a perfect code for finite groups. As an application, we determine all subgroup perfect codes of extraspecial 2-groups and finite groups whose Sylow 2-subgroup is extraspecial.
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
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Cooperative Communication and Network Coding
