@mastersthesis{
    Kaski:mscthesis,
    author = "Kaski, Petteri",
    school = "Helsinki University of Technology, Department of Computer Science and Engineering",
    title = "Isomorph-Free Exhaustive Generation of Combinatorial Designs",
    abstract = "This thesis investigates algorithmic isomorph-free exhaustive generation of balanced incomplete block designs (BIBDs), resolvable balanced incomplete block designs (RBIBDs), and the corresponding resolutions. In particular, three algorithms for isomorph-free exhaustive generation of $(v,k,\lambda)$-BIBDs and resolutions are described and applied to settle existence and classification problems. \par The first algorithm generates BIBDs point by point using an orderly algorithm in combination with a maximum clique algorithm. The second and third algorithm generate resolutions of BIBDs by utilizing a correspondence between resolutions and certain optimal $q$-ary error-correcting codes. The second algorithm generates the corresponding codes codeword by codeword, and is analogous in structure to the first algorithm. The third algorithm generates codes coordinate by coordinate, and is based on the recent isomorph-free exhaustive generation framework of Brendan McKay. \par The main result of this thesis is a proof of nonexistence for a (15,5,4) RBIBD by exhaustive computer search. Other new classification results include the classifications of the $(13,6,5)$- and $(14,7,6)$-BIBDs and the $(16,4,2)$-, $(14,7,12)$-, and $(24,12,11)$-RBIBDs together with their resolutions, which correspond to classifications of the $(10,16,8)_4$, $(26,14,14)_2$, and $(23,24,12)_2$ error-correcting $(n,M,d)_q$-codes, respectively. Additionally, a number of earlier classification results are corroborated.",
    month = "September",
    flags = "copy",
    year = "2001",
    keywords = "balanced incomplete block design, error-correcting code, exhaustive search, group action, isomorph rejection, orderly algorithm, resolution, resolvable design"
}