A family of group divisible designs with arbitrary block sizes
Yu-pei Huang, Chia-an Liu, Yaotsu Chang, Chong-Dao Lee
TL;DR
This paper introduces a new family of group divisible designs (GDDs) derived from decoding quadratic residue codes, expanding the methods for constructing combinatorial designs involving BIBDs.
Contribution
The paper extends existing QR code decoding techniques to generate a novel family of GDDs linked with BIBDs, offering new combinatorial design constructions.
Findings
New family of GDDs constructed from QR code decoding
Connection established between GDDs and BIBDs
Potential applications in combinatorial design theory
Abstract
Recently, a construction of group divisible designs (GDDs) derived from the decoding of quadratic residue (QR) codes was given. In this paper, we extend the idea to obtain a new family of GDDs, which is also involved with a well-known balanced incomplete block design (BIBD).
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 · DNA and Biological Computing