Decomposable three-way layouts

DOI10.1016/0378-3758(93)90133-QzbMath0785.62080OpenAlexW2036563913MaRDI QIDQ689403

Julie Bérubé, George P. H. Styan

Publication date: 5 December 1993

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(93)90133-q

zbMATH Keywords

connectednessorthogonalitybalancefull information matricesgeneralized decomposability propertythree-way layoutstreatment-column subdesignstreatment-row subdesigntwo-way elimination of heterogeneity designstwo-way level designs

Mathematics Subject Classification ID

Design of statistical experiments (62K99) Statistical block designs (62K10)

Related Items (3)

Some bounds for balanced two-way elimination of heterogeneity designs ⋮ On the E-optimality of some two-way elimination of heterogeneity designs ⋮ On the connectivity problem for \(m\)-way designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposability of the C-matrix of a two-way elimination of heterogeneity design
• On connectedness in two-way elimination of heterogeneity designs
• Connectedness in row-column designs
• On connectedness of ordinary two-way elimination of heterogeneity designs
• Some Properties of connectedness in two-way designs
• Some Systematic Methods of Construction of Designs for TwoWay Elimination of Heterogeneity^*

This page was built for publication: Decomposable three-way layouts