Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices

Journal of Combinatorial Theory. Series A

Volumn 92, Issue 2, 2000, Pages 186-196

  Lam, Clement ^a   Lam, Sigmund ^a   Tonchev, Vladimir D ^b  

^a Gina Cody School of Engineering and Computer Science   (Canada)

^b MICHIGAN TECHNOLOGICAL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345814291     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.2000.3060     Document Type: Article

References (15)

1. Beth T., Jungnickel D., Lenz H. Design Theory. 1993;Cambridge Univ. Press, Cambridge.
2. Bhat V. N. Nonisomorphic solutions of some BIBDs, III. J. Combin. Theory Ser. A. 12:1972;38-42.
3. Colbourn C. J., Dinitz J. H. The CRC Handbook of Combinatorial Designs. 1996;CRC Press, New York.
4. Jungnickel D. The number of designs with classical parameters grows exponentially. Geom. Dedicata. 16:1984;167-178.
5. Kantor W. M. Automorphism groups of Hadamard matrices. J. Combin. Theory. 6:1969;279-281.
6. Kantor W. M. Automorphisms and isomorphisms of symmetric and affine designs. J. Algebraic Combin. 3:1994;307-338.
7. Lam C., Kolesova G., Thiel L. A computer search for finite projective planes of order 9. Discrete Math. 92:1991;187-195.
8. Lam C., Thiel L. Backtrack search with isomorph rejection and consistency check. J. Symbol. Comput. 7:1989;473-485.
9. Lam C. W. H. Computer construction of block designs. Bailey. Surveys in Combinatorics, 1997. London Mathematical Society Lecture Note Series. 241:1997;51-66 Cambridge Univ. Press, Cambridge.
10. Lam C., Tonchev V. Classification of affine resolvable 2-(27, 9, 4) designs. J. Statist. Plann. Inference. 56:1996;187-202.
11. Lam C., Tonchev V. Classification of affine resolvable 2-(27, 9, 4) designs: Corrigendum. J. Statist. Plann. Inference. 86:2000;277-278.
12. Mathon R., Rosa A. 2-(v, k, λ) designs of small order. Colbourn C. J., Dinitz J. H. The CRC Handbook of Combinatorial Designs. 1996;3-41 CRC Press, New York.
13. V. C. Mavron, and, V. D. Tonchev, On symmetric nets and generalized Hadamard matrices from affine designs, preprint.
14. Norman C. W. Nonisomorphic Hadamard designs. J. Combin. Theory Ser. A. 21:1976;73-86.
15. Spence E. (40, 13, 4) designs obtained from strongly regular graphs. Hirschfeld J. W. P., Hughes D. R., Thas J. A. Advances in Finite Geometries and Designs. 1991;359-368 Oxford Univ. Press, Oxford.