Premium
ON RESOLVABLE INCOMPLETE BLOCK DESIGNS 1
Author(s) -
Sharma V. K.,
Das M. N.
Publication year - 1985
Publication title -
australian journal of statistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.434
H-Index - 41
eISSN - 1467-842X
pISSN - 0004-9581
DOI - 10.1111/j.1467-842x.1985.tb00575.x
Subject(s) - block (permutation group theory) , prime (order theory) , prime power , combinatorics , mathematics , block design , discrete mathematics
summary A method of constructing resolvable incomplete block designs for v(=ks, 2 ≤ k ≤ s ‐ 1) treatments in blocks of size k using mutually orthogonal Latin squares is proposed. It has been seen in particular that when the number of replications is s — 1 (or s), which is feasible if s is a prime or a prime power, the method gives PBIB (3) (or semi‐regular GD) designs. The analysis of such designs has also been discussed.