Combinatorial Designs with Resolvable Subdesigns Based on Generalized Hadamard matrices

Key Points

• The aim is to identify new series of resolvable rectangular designs and their subdesigns.
• Utilization of generalized Hadamard matrices to construct designs.
• Identification of resolvable rectangular and group divisible designs.
• Examination of resolvable group divisible and L2 subdesigns.
• Discovery of specific series of resolvable rectangular and group divisible designs.
• Identification of their potential subdesigns based on generalized Hadamard matrices.