Enumeration of 2-(9, 3, lambda) Designs and Their Resolutions

Authors: Östergård P.R.J.1; Kaski P.2

Source: Designs, Codes and Cryptography, Volume 27, Numbers 1-2, October 2002 , pp. 131-137(7)

Publisher: Springer

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Abstract:

We consider 2-(9, 3, lambda) designs, which are known to exist for all lambda ge 1, and enumerate such designs for lambda = 5 and their resolutions for 3 le lambda le 5, the smallest open cases. The number of nonisomorphic such structures obtained is 5 862 121 434, 426, 149 041, and 203 047 732, 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; oderly algorithm; resolved design

Language: English

Document Type: Research article

Affiliations: 1: Department of Electrical and Communications Engineering, Helsinki University of Technology, P.O. Box 3000, 02015 HUT, Finland patric.ostergard@hut.fi 2: Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, 02015 HUT, Finland petteri.kaski@hut.fi

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$47.00 plus tax      Refund Policy

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A