A Note on Resolvable Incomplete‐Block Designs

Patterson, H. D.; Williams, E. R.; Paterson, L.

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

A Note on Resolvable Incomplete‐Block Designs

Date

1985

Authors

Patterson, H. D.

Williams, E. R.

Paterson, L.

Abstract

KHARE and FEDERER (1981) have proposed a method for constructing resolvable incomplete‐block designs with, they claim, higher efficiencies than those of the α‐designs described by PATTERSON and WILLIAMS (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 PATTERSON, WILLIAMS and HUNTER (1978).