A theory on constructing 2ⁿ-m designs with general minimum lower order confounding
From MaRDI portal
Publication:3097902
DOI10.5705/SS.2008.336zbMATH Open1225.62111OpenAlexW2152407928MaRDI QIDQ3097902FDOQ3097902
Authors: Pengfei Li, Shengli Zhao, Runchu Zhang 
Publication date: 10 November 2011
Published in: STATISTICA SINICA (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5705/ss.2008.336
Recommendations
- Some theory for constructing general minimum lower order confounding designs
- Some results on constructing general minimum lower order confounding \(2^{n-m}\) designs for \(n\leq 2^{n-m-2}\)
- Some properties of general minimum lower-order confounding designs
- On construction of general minimum lower order confounding \(2^{n - m}\) designs with \(N/4+1\leq n\leq 9N/32\)
- General minimum lower order confounding designs: an overview and a construction theory
aliased effect-number patterneffect hierarchy principleresolutionYates orderfractional factorial designminimum aberrationwordlength pattern
Cited In (36)
- A note on the construction of blocked two-level designs with general minimum lower order confounding
- A theory on constructing blocked two-level designs with general minimum lower order confounding
- Construction of some \(s\)-level regular designs with general minimum lower-order confounding
- A Generalized General Minimum Lower Order Confounding Criterion for General Orthogonal Designs
- On construction of blocked general minimum lower-order confounding \(2^{n - m} : 2^r\) designs with \(N / 4 + 1 \leq n \leq 5 N / 16\)
- Lower-order confounding information of inverse Yates-order two-level designs
- Computer algorithms of lower-order confounding in regular designs
- Construction of some \(3^{n-m}\) regular designs with general minimum lower order confounding
- Results on constructing \(s^{n-m}\) regular designs with general minimum lower-order confounding
- Some results on two-level regular designs with general minimum lower-order confounding
- General minimum lower-order confounding split-plot designs with important whole-plot factors
- Construction of regular 2n41 designs with general minimum lower-order confounding
- Some theory for constructing general minimum lower order confounding designs
- 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\)
- Optimal confounding measures for two-level regular designs
- Analysis on \(s^{n-m}\) designs with general minimum lower-order confounding
- Lower-order confounding information of inverse Yates-order designs with three levels
- Title not available (Why is that?)
- Construction of blocked designs with multi block variables
- On construction of optimal two-level designs with multi block variables
- On general minimum lower order confounding criterion for \(s\)-level regular designs
- A note on extending the alias length pattern
- On simplifying the calculations leading to designs with general minimum lower-order confounding
- Characterization of three-order confounding via consulting sets
- A generalized general minimum lower order confounding criterion for nonregular designs
- An optimal selection of two-level regular single arrays for robust parameter experiments
- Some results on constructing general minimum lower order confounding \(2^{n-m}\) designs for \(n\leq 2^{n-m-2}\)
- Blocked two-level regular designs with general minimum lower order confounding
- Three-level regular designs with general minimum lower-order confounding
- A note on constructing clear compromise plans
- Some properties of general minimum lower-order confounding designs
- Some results on constructing two-level block designs with general minimum lower order confounding
- Partial aliased effect number pattern and selection of optimal compromise designs
- Robust two-level regular fractional factorial designs
- Blocked factor aliased effect-number pattern and column rank of blocked regular designs
This page was built for publication: A theory on constructing \(2^{n-m}\) designs with general minimum lower order confounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3097902)
