A Note on Resolvable Incomplete‐Block Designs

dc.contributor.authorPatterson, H. D.en
dc.contributor.authorWilliams, E. R.en
dc.contributor.authorPaterson, L.en
dc.date.accessioned2026-01-07T15:41:02Z
dc.date.available2026-01-07T15:41:02Z
dc.date.issued1985en
dc.description.abstractKHARE 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).en
dc.description.statusPeer-revieweden
dc.format.extent5en
dc.identifier.issn0323-3847en
dc.identifier.scopus84980193740en
dc.identifier.urihttps://hdl.handle.net/1885/733803975
dc.language.isoenen
dc.sourceBiometrical Journalen
dc.subjectefficiencyen
dc.subjectresolvable incomplete‐block designen
dc.subjectα‐designen
dc.titleA Note on Resolvable Incomplete‐Block Designsen
dc.typeJournal articleen
dspace.entity.typePublicationen
local.bibliographicCitation.lastpage79en
local.bibliographicCitation.startpage75en
local.contributor.affiliationPatterson, H. D.; University of Edinburghen
local.contributor.affiliationWilliams, E. R.; CSIROen
local.contributor.affiliationPaterson, L.; University of Edinburghen
local.identifier.citationvolume27en
local.identifier.doi10.1002/bimj.4710270109en
local.identifier.pure5ea1671f-9046-44a7-94d6-b95bb0757d0fen
local.identifier.urlhttps://www.scopus.com/pages/publications/84980193740en
local.type.statusPublisheden

Downloads