Publication | Closed Access
The existence of uniform 5-GDDs
44
Citations
0
References
1997
Year
Index UnityComputational Complexity TheoryEngineeringBlock DesignDesignGroup Divisible DesignsFormal MethodsCombinatorial DesignCombinatorial Design TheoryDiscrete MathematicsBlock Size FiveRandomized AlgorithmFormal VerificationData Security
In this article, we construct group divisible designs (GDDs) with block size five, group-type gu and index unity. The necessary condition for the existence of such a GDD is u ≷ 5, (u - 1)g ≡ 0 (mod 4) and u(u - 1)g2 ≡ 0 (mod 20). It is shown that these necessary conditions are also sufficient, except possibly in a few cases. Additionally, a new construction to obtain GDDs using holey TDs is presented. © 1997 John Wiley & Sons, Inc. J Combin Designs 5: 275–299, 1997