Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 111-118 |
| Number of pages | 8 |
| Journal | Australian and New Zealand Journal of Statistics |
| Volume | 40 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Mar 1998 |