PGM2
Recursive construction of balanced incomplete block designs (BIBDs), their successive generations, resolvable BIBDs (RBIBDs) and associated uniform designs (UDs), derived from finite projective geometries PG(m, p) over a Galois field GF(p) of any prime order p. Implements and generalises the method of Boudraa, Gheribi-Aoulmi and Laib (2013, International Journal of Research and Reviews in Applied Sciences, 17(2), 167-176), which was previously available only for p = 2, and the uniform design constructions of Fang et al. (2004) <doi:10.1016/S0012-365X(03)00100-6>. Designs of every recursion stage can be extracted, and all constructions are validated against the parameters published in the original paper.
This page was built for software: PGM2
