Some results on constructing general minimum lower order confounding \(2^{n-m}\) designs for \(n\leq 2^{n-m-2}\)
From MaRDI portal
Publication:464391
DOI10.1007/s00184-013-0461-9zbMath1305.62292OpenAlexW109547034MaRDI QIDQ464391
J. Herrera, D. Rodríguez-Gómez
Publication date: 17 October 2014
Published in: Metrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00184-013-0461-9
resolutionfractional factorial designaliased effect-number patternminimum aberrationgeneral minimum lower-order confoundingwordlength pattern
Related Items (7)
Lower-order confounding information of inverse Yates-order two-level designs ⋮ A note on constructing clear compromise plans ⋮ Results on constructing \(s^{n-m}\) regular designs with general minimum lower-order confounding ⋮ Lower-order confounding information of inverse Yates-order designs with three levels ⋮ Characterization of three-order confounding via consulting sets ⋮ Construction of some \(s\)-level regular designs with general minimum lower-order confounding ⋮ Construction of some \(3^{n-m}\) regular designs with general minimum lower order confounding
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some results on two-level regular designs with general minimum lower-order confounding
- General minimum lower order confounding designs: an overview and a construction theory
- On construction of general minimum lower order confounding \(2^{n - m}\) designs with \(N/4+1\leq n\leq 9N/32\)
- Some results on \(2^{n-k}\) fractional factorial designs and search for minimum aberration designs
- Some results on \(s^{n-k}\) fractional factorial designs with minimum aberration or optimal moments
- A modern theory of factorial designs.
- A theory on constructing 2n-m designs with general minimum lower order confounding
- Minimum Aberration 2 k-p Designs
- FRACTIONAL REPLICATION ARRANGEMENTS FOR FACTORIAL EXPERIMENTS WITH FACTORS AT TWO LEVELS
This page was built for publication: Some results on constructing general minimum lower order confounding \(2^{n-m}\) designs for \(n\leq 2^{n-m-2}\)
