A pair of disjoint 3-GDDs of type g(t)u(1)
Pairwise disjoint 3-GDDs can be used to construct some optimal constant-weight codes. We study the existence of a pair of disjoint 3-GDDs of type g (t) u (1) and establish that its necessary conditions are also sufficient.
disjoint constant-weight code group divisible design resolvable modified group divisible design idempotent latin square constant-composition code