Some general existence conditions for balanced arrays of strength \(t\) and 2 symbols

DOI10.1016/0097-3165(72)90026-XzbMath0243.05017MaRDI QIDQ2554334

Jagdish N. Srivastava

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of finite geometries (05B25) Factorial statistical designs (62K15)

Related Items (33)

Further investigations on balanced arrays ⋮ Balanced incomplete arrays ⋮ Norm of alias atrices for (l + 1)-factor interactions in balanced fractional 2^Mfactorial designs of resolution 2 l+1 ⋮ Existence Conditions for Balanced Fractional 2^mFactorial Designs of Resolution 2l + 1 Derived from Simple Arrays ⋮ Cyclic orthogonal and balanced arrays ⋮ A-optimal partially balanced fractional \(2^{m_ 1+m_ 2}\) factorial designs of resolution V, with \(4\leq m_ 1+m_ 2\leq 6\) ⋮ Existence of 2-symbol balanced arrays of strength \(t\) and \(t+2\) constraints ⋮ J.N. Srivastava and experimental design ⋮ Balanced arrays of strength 4 and balanced fractional \(3^m\) factorial designs ⋮ Generalized intersection patterns and two-symbol balanced arrays ⋮ Linear programming bounds for balanced arrays ⋮ Minimal point second order designs ⋮ Characteristic polynomials of the information matrices of balanced fractional \(3^ m\) factorial designs of resolution V ⋮ Orthogonal arrays obtainable as solutions to linear equations over finite fields ⋮ Balanced arrays from quadratic functions ⋮ Mutually balanced nested designs ⋮ A series of search designs for \(2^ m\) factorial designs of resolution V which permit search of one or two unknown extra three-factor interactions ⋮ System of equations related to the existence conditions for arrays ⋮ Balanced 2^mfactorial designs of resolution v which allow search and estimation of one extra unknown effect, 4 ≤ m ≤ 8 ⋮ Optimal balanced \(2^7\) fractional factorial designs of resolution \(v\), with \(N\leq 42\) ⋮ Bounds on the number of constraints for balanced arrays of strength t ⋮ Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints ⋮ Incomplete block designs through orthogonal and incomplete orthogonal arrays ⋮ On existence and construction of balanced arrays ⋮ On computer generation of balanced arrays ⋮ Some existence conditions for partially balanced arrays with 2 symbols ⋮ Characterization of singular balanced fractional s^mfactorial designs derivable from balanced arrays with maximum number of constraints ⋮ On some optimal fractional \(2^ m \)factorial designs of resolution V ⋮ Arrays of strength s on two symbols ⋮ Balanced E-optimal designs of resolution III for the \(2^ m\times 3^ n\) series ⋮ Search designs for \(2^ m\) factorials derived from balanced arrays of strength \(2(\ell +1)\) and AD-optimal search designs ⋮ More precise tables of Srivastava-Chopra balanced optimal \(2^ m\) fractional factorial designs of resolution V, m\(\leq 6\) ⋮ Comparisons of search designs using search probabilities

Cites Work

• Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
• On Some Methods of Construction of Partially Balanced Arrays
• On Orthogonal Arrays
• On a Bound Useful in the Theory of Factorial Designs and Error Correcting Codes
• Orthogonal Arrays of Strength two and three
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some general existence conditions for balanced arrays of strength \(t\) and 2 symbols