In this section we give a direct construction for a 4-GDD of type \(2^2 5^5\) .
This construction was found by initially using counting arguments and then making a computer search without assuming any automorphisms. Using the program nauty by McKay and Piperno [1]}, it was confirmed that this design has no non-trivial automorphisms.
