Some results on perfect codes in Cayley sum graphs
Masoumeh Koohestani, Doost Ali Mojdeh, Mohsen Ghasemi, Hassan, Khodaiemehr
TL;DR
This paper investigates the conditions under which normal subgroups of finite groups serve as perfect codes within Cayley sum graphs, providing a precise characterization.
Contribution
It introduces a necessary and sufficient condition for normal subgroups to be subgroup perfect codes in Cayley sum graphs.
Findings
Characterization of subgroup perfect codes in Cayley sum graphs
Necessary and sufficient condition for normal subgroups
Advancement in understanding algebraic coding in graph structures
Abstract
We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.
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
TopicsFinite Group Theory Research · graph theory and CDMA systems · Coding theory and cryptography