Classification of affine resolvable 2-(27, 9, 4) designs

Journal of Statistical Planning and Inference

Volumn 56, Issue 2, 1996, Pages 187-202

  Lam, Clement ^a   Tonchev, Vladimir D ^b  

^a Dept of Electrical and Computer Engineering   (Canada)

^b MICHIGAN TECHNOLOGICAL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030589767     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-3758(96)00018-3     Document Type: Article

References (11)

1. Beth, T., D. Jungnickel and H. Lenz (1986). Design Theory, Cambridge Univ. Press, Cambridge.
2. Bose, R.C. (1942). A note on the resolvability of incomplete block designs. Sankhyã 6, 105-110.
3. Bose, R.C. and K.A. Bush (1952). Orthogonal arrays of strength two and three. Ann. Math. Statist. 23, 508-524.
4. Brouwer, A.E. (1987). Private communication.
5. Hamada, N. (1973). On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes. Hiroshima Math. J. 3, 154-226.
6. Jungnickel, D. (1984). The number of designs with classical parameters grows exponentially. Geom. Dedicata 16, 167-178.
7. Semakov, N.V. and V.A. Zinoviev (1968). Equidistant q-ary codes with maximal distance and resolvable incomplete block designs (in Russian). Problemy Peredachi informatsii 4 (2), 3-10.
8. Shrikhande, M.S. and S.S. Sane (1991). Quasi-Symmetric Designs. London Mathematical Society Lecture Note Series, Vol. 164, Cambridge Univ. Press, Cambridge.
9. Shrikhande, S.S. (1976). Affine resolvable balanced incomplete block designs: a survey, Aequationes Math. 14, 251-269.
10. Tonchev, V.D. (1986). Quasi-symmetric 2-(31, 7, 7) designs and a revision of Hamada's conjecture. J. Combin. Theory Ser. A 42, 104-110.
11. Tonchev, V.D. (1988). Combinatorial Configurations, Longman, Wiley, New York.