A New Class of Resolvable Incomplete Block Designs

Abstract

This paper describes an algorithm for constructing resolvable incomplete block designs for any number of varieties v and block size k such that v is a multiple of k . These designs are called α -designs. They include as special cases some lattice and resolvable cyclic designs. Additional designs with two block sizes differing by one plot are derived by omitting one or more varieties of the α -designs. The designs are shown to be available with high efficiency factors for a wide range of parameter values.