On a lower bound for the number of assemblies in fractional \(2^m\) factorial designs of resolution \(2 \ell \)
From MaRDI portal
Publication:2301112
DOI10.1016/j.jspi.2019.10.009zbMath1437.62311MaRDI QIDQ2301112
Yoshifumi Hyodo, Masahide Kuwada
Publication date: 28 February 2020
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2019.10.009
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Contributions to balanced fractional \(2^m\) factorial designs derived from balanced arrays of strength \(2l\)
- Balanced arrays of strength 21 and balanced fractional \(2^m\) factorial designs
- Existence Conditions for Balanced Fractional 2mFactorial Designs of Resolution 2l + 1 Derived from Simple Arrays
- NECESSARY AND SUFFICIENT CONDITION FOR A BALANCED ARRAY OF STRENGTH 21 TO BE A BALANCED FRACTIONAL 2 FACTORIAL DESIGN OF RESOLUTION 2l
- Non-Orthogonal Designs of Even Resolution
- On the Characteristic Roots of the Information Matrix of $2^m$ Balanced Factorial Designs of Resolution V, with Applications