Premium
t ‐Latinized Designs
Author(s) -
John J.A.,
Williams E.R.
Publication year - 1998
Publication title -
australian and new zealand journal of statistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.434
H-Index - 41
eISSN - 1467-842X
pISSN - 1369-1473
DOI - 10.1111/1467-842x.00012
Subject(s) - mathematics , block (permutation group theory) , set (abstract data type) , construct (python library) , variety (cybernetics) , binary number , block design , combinatorics , arithmetic , statistics , discrete mathematics , computer science , programming language
A variety trial sometimes requires a resolvable block design in which the replicates are set out next to each other. The long blocks running through the replicates are then of interest. A t ‐latinized design is one in which groups of these t long blocks are binary. In this paper examples of such designs are given. It is shown that the algorithm described by John & Whitaker (1993) can be used to construct designs with high average efficiency factors. Upper bounds on these efficiency factors are also derived.