Volume 6, Issue 1, January 2017, Page: 52-60
Construction Procedure for Non-trivial T-designs
John Chibayi, Department of Statistics and Actuarial Science, MasenoUniverisity, Nairobi, Kenya
David Alila, Department of Mathematics, MasindeMuliro University of Science and Technology, Nairobi, Kenya
Fredrick Onyango, Department of Statistics and Actuarial Science, MasenoUniverisity, Nairobi, Kenya
Received: Jul. 20, 2016;       Accepted: Aug. 8, 2016;       Published: Feb. 22, 2017
DOI: 10.11648/j.ajtas.20170601.17      View  2687      Downloads  59
A t-design is a generation of balanced incomplete block design (BIBD) where λ is not restricted to the blocks in which a pair of treatments occurs but to the number of blocks in which any t treatments (t = 2,3…) occurs. The problem of finding all parameters (t, v, k, λt) for which t-(v, k, λt) design exists is a long standing unsolved problem especially with λ=1 (Steiner System) as no Steiner t-designs are known for t ≥ 6 when v > k. The objective of this study therefore to develop new methods of constructing t-designs with t ≥ 3 and λ ≥1. In this study t-design is constructed by relating known BIB designs, combinatorial designs and algebraic structures with t-designs.
Block Designs, Steiner Systems, T-designs
To cite this article
John Chibayi, David Alila, Fredrick Onyango, Construction Procedure for Non-trivial T-designs, American Journal of Theoretical and Applied Statistics. Vol. 6, No. 1, 2017, pp. 52-60. doi: 10.11648/j.ajtas.20170601.17
Copyright © 2017 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License ( which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Blanchard, J. L (1995a). A construction for Steiner 3-designs, Journal of combinatorial Theory A, 71, 60-67.
Blanchard, J. L. (1995b). An extension theorem for Steiner systems, Discrete Mathematics 141, no. 1-3, 23-35.
Blanchard, J. L (1995c). A construction for orthogonal arrays with strength t ≥ 3, Discrete math 137, no. 1-3, 35-44.
Bogart, K. P. (1990). Introductory Combinatorics second edition, Harcourt Brace Bose, Jovanovich, Inc. Orlando, Florida.
Cameron, P. J., Maimani, H. R., Omidi, G. R., and Tayfeh-Rezaie, B. (2006). 3-designs PGL (2, q), Discrete Mathematics, 306, vol.23, 3063-3073.
Colbourn, C. J. et al. (2002). Orthogonal arrays of strength three from regular 3-wise balanced designs.
Dinitz, J. H., & Stinson, D. R. (1992). Contemporary Design Theory: A collection ofsurveys, Wiley-Interscience.
Hartman, A. (1994). The fundamental construction for 3-designs. Discrete math 124, no.1-3, 107-131.
Magliveras, S. S., Kramer, E. S., & Stinson, D. R. (1993). Some new Large sets of t-designs. Australasian journal of Combinatorics 7, pp 189-193.
Mohácsy, H., and Ray-Chaudhuri, D. K. (2001). A construction for infinite families of Steiner 3-designs, Journal of Combinatorial Theory A, 94, 127-141.
Mohácsy, H., and Ray-Chaudhuri, D. K. (2002). Candelabra Systems and designs, Journalof Statistical planning and Inference, 106, 419-448.
Mohácsy, H., and Ray-Chaudhuri, D. K. (2003). A construction for group divisible t-designs with strength t ≥ 2 and index unity, Journal of Statistical planning and Inference, 109, 167-177.
Onyango, O. F. (2010). Construction of t-(v, k, λt) designs, Journal of mathematical science, vol. 21 no. 4 pp 521-526.
Qiu-rong Wu. (1991). A note on extending t-designs, Australasia. Journal of Combinatorics, 4 pp 229-235.
Stinson, D. R. (2004). Combinatorial Designs: Construction and Analysis, Springer_Verlag, New York, Inc., New York.
Browse journals by subject