Reference:
Patric R. J. Östergård and Petteri Kaski. Enumeration of 2-(9,3,lambda) designs and their resolutions. Designs, Codes and Cryptography, 27:131–137, 2002.
Abstract:
We consider - designs, which are known to exist for all , and enumerate such designs for and their resolutions for , the smallest open cases. The number of nonisomorphic such structures obtained is , , , and , respectively. The designs are obtained by an orderly algorithm, and the resolutions by two approaches: either by starting from the enumerated designs and applying a clique-finding algorithm on two levels or by an orderly algorithm.
Keywords:
automorphism group, BIBD, orderly algorithm, resolved design
Suggested BibTeX entry:
@article{OsKa02,
author = {Patric R. J. {\"O}sterg{\aa}rd and Petteri Kaski},
journal = {Designs, Codes and Cryptography},
pages = {131--137},
title = {Enumeration of 2-(9,3,\lambda) designs and their resolutions},
volume = {27},
year = {2002},
}
|