Subgroup Perfect Codes of $\mathcal{A}_t$-Groups and Their Applications
Huye chen, Binbin Li, Jingjian Li, Hao Yu

TL;DR
This paper classifies subgroup perfect codes in certain finite groups called _t-groups for t=0,1, and characterizes these codes in groups with abelian Sylow 2-subgroups, advancing understanding of perfect codes in algebraic structures.
Contribution
It provides a complete classification of subgroup perfect codes in _t-groups for t=0,1, and characterizes codes in groups with abelian Sylow 2-subgroups, extending previous work.
Findings
Complete classification of subgroup perfect codes in _t-groups for t=0,1
Characterization of subgroup perfect codes in groups with abelian Sylow 2-subgroups
Reduction of subgroup perfect code study to p-groups, especially 2-groups
Abstract
A subset of the vertex set of a graph is called a perfect code in if every vertex of is at distance no more than 1 to exactly one vertex of . A subgroup of a group is called a subgroup perfect code of if is a perfect code in some Cayley graph of . Recently, Zhang reveals that the study of subgroup perfect codes of finite groups naturally reduces to the case of -groups, especially -groups. Based on the combined works of Berkovich, Janko and Zhang, every -group is an -group. In this work, we establish a complete classification of subgroup perfect codes of -groups for . Moreover, subgroup perfect codes of finite groups with abelian Sylow -subgroups are also characterized.
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.
