Premium
A Note on Resolvable Incomplete‐Block Designs
Author(s) -
Patterson H. D.,
Williams E. R.,
Paterson L.
Publication year - 1985
Publication title -
biometrical journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.108
H-Index - 63
eISSN - 1521-4036
pISSN - 0323-3847
DOI - 10.1002/bimj.4710270109
Subject(s) - block (permutation group theory) , mathematics , block design , table (database) , combinatorics , discrete mathematics , algorithm , arithmetic , computer science , data mining
K HARE and F EDERER (1981) have proposed a method for constructing resolvable incomplete‐block designs with, they claim, higher efficiencies than those of the α‐designs described by P ATTERSON and W ILLIAMS (1976a). This claim is shown here to be unfounded. The best α‐designs have higher efficiencies than the Khare and Federer designs, and can be constructed straightforwardly using the concise table of generating arrays in P ATTERSON , W ILLIAMS and H UNTER (1978).