An infinite series of resolution III.2 designs for the \(2^ m\) factorial experiment

DOI10.1016/0012-365X(91)90411-TzbMath0751.05022MaRDI QIDQ1185090

Sanjay Arora, Jagdish N. Srivastava

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(2^ m\) factorial experiment; resolution III.2 designs

Mathematics Subject Classification ID

05B30: Other designs, configurations

Related Items

J.N. Srivastava and experimental design, Search designs for estimating main effects and searching several two-factor interactions in general factorials, Search designs for estimating main effects and searching several two- factor interactions in general factorials

Cites Work

• Minimal 2-coverings of a finite affine space based on GF(2)
• Main effect plus one or two plans for \(2^ m\) factorials
• Search designs for \(2^ m\) factorials derived from balanced arrays of strength \(2(\ell +1)\) and AD-optimal search designs
• Some search designs for symmetric and asymmetric factorials
• Search designs for \(2^ m\) factorial experiments
• Main effect plan for \(2^n\) factorials which allow search and estimation of one unknown effect
• Weakly resolvable IV.3 search designs for the \(p^ n\) factorial experiment
• On some new search designs for \(2^ m\) factorial experiments
• Some results in search designs with special reference to \(2^m\) factorial experiments
• A bound connected with 2⁶factorial search designs of resolution 3.1
• A necessary condition for the existence of main effect plus one plans for 2^mfactorials
• Enumeration and Representation of Nonisomorphic Bipartite Graphs
• Balanced 2^mfactorial designs of resolution v which allow search and estimation of one extra unknown effect, 4 ≤ m ≤ 8
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item