Linked systems of symmetric group divisible designs
Hadi Kharaghani, Sho Suda

TL;DR
This paper introduces linked systems of symmetric group divisible designs, explores their connection to association schemes, and provides bounds and examples, advancing combinatorial design theory.
Contribution
It defines linked systems of symmetric group divisible designs, establishes their connection with association schemes, and derives an upper bound on their number.
Findings
Established a connection with association schemes
Derived an upper bound on linked systems
Provided examples of linked systems
Abstract
We introduce the concept of linked systems of symmetric group divisible designs. The connection with association schemes is established, and as a consequence we obtain an upper bound on the number of symmetric group divisible designs which are linked. Several examples of linked systems of symmetric group divisible designs are provided.
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 · Finite Group Theory Research · Coding theory and cryptography
