Decomposable three-way layouts
DOI10.1016/0378-3758(93)90133-QzbMATH Open0785.62080OpenAlexW2036563913MaRDI QIDQ689403FDOQ689403
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
orthogonalitybalanceconnectednessfull information matricesgeneralized decomposability propertythree-way layoutstreatment-column subdesignstreatment-row subdesigntwo-way elimination of heterogeneity designstwo-way level designs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On connectedness in two-way elimination of heterogeneity designs
- Connectedness in row-column designs
- Title not available (Why is that?)
- 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*
- Decomposability of the C-matrix of a two-way elimination of heterogeneity design
Cited In (7)
- Title not available (Why is that?)
- Decomposability of the C-matrix of a two-way elimination of heterogeneity design
- On the E-optimality of some two-way elimination of heterogeneity designs
- Some bounds for balanced two-way elimination of heterogeneity designs
- On the connectivity problem for \(m\)-way designs
- Title not available (Why is that?)
- Title not available (Why is that?)
Recommendations
This page was built for publication: Decomposable three-way layouts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689403)
