The spectrum for large sets of $(3,\lambda)$-GDDs of type $g^u$
X. Niu, H. Cao, and R. Javadi

TL;DR
This paper completely characterizes the existence conditions for large sets and simple instances of (3,λ)-group divisible designs of type g^u, advancing combinatorial design theory.
Contribution
It provides a complete solution to the existence problem for large sets and simple (3,λ)-GDDs of type g^u, which was previously unresolved.
Findings
Complete existence characterization for large sets of (3,λ)-GDDs.
Existence criteria for simple (3,λ)-GDDs of type g^u.
Advancement in combinatorial design theory.
Abstract
In this paper, we completely solve the existence of large sets of -GDDs of type and the existence of a simple -GDD of type .
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
TopicsCoding theory and cryptography · graph theory and CDMA systems · Geometric and Algebraic Topology
