Pages that link to "Item:Q2554334"

The following pages link to Some general existence conditions for balanced arrays of strength \(t\) and 2 symbols (Q2554334):

Displaying 33 items.

• J.N. Srivastava and experimental design (Q389405) (← links)
• Arrays of strength s on two symbols (Q800364) (← links)
• Orthogonal arrays obtainable as solutions to linear equations over finite fields (Q913803) (← links)
• Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints (Q995427) (← links)
• On some optimal fractional \(2^ m \)factorial designs of resolution V (Q1052783) (← links)
• Balanced E-optimal designs of resolution III for the \(2^ m\times 3^ n\) series (Q1062399) (← links)
• Search designs for \(2^ m\) factorials derived from balanced arrays of strength \(2(\ell +1)\) and AD-optimal search designs (Q1068499) (← links)
• More precise tables of Srivastava-Chopra balanced optimal \(2^ m\) fractional factorial designs of resolution V, m\(\leq 6\) (Q1071449) (← links)
• Balanced incomplete arrays (Q1092050) (← links)
• A-optimal partially balanced fractional \(2^{m_ 1+m_ 2}\) factorial designs of resolution V, with \(4\leq m_ 1+m_ 2\leq 6\) (Q1107241) (← links)
• Existence of 2-symbol balanced arrays of strength \(t\) and \(t+2\) constraints (Q1108278) (← links)
• Balanced arrays of strength 4 and balanced fractional \(3^m\) factorial designs (Q1135597) (← links)
• Generalized intersection patterns and two-symbol balanced arrays (Q1153154) (← links)
• Minimal point second order designs (Q1158709) (← links)
• Characteristic polynomials of the information matrices of balanced fractional \(3^ m\) factorial designs of resolution V (Q1158713) (← links)
• Mutually balanced nested designs (Q1183978) (← links)
• 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 (Q1206646) (← links)
• System of equations related to the existence conditions for arrays (Q1208356) (← links)
• Optimal balanced \(2^7\) fractional factorial designs of resolution \(v\), with \(N\leq 42\) (Q1223421) (← links)
• Incomplete block designs through orthogonal and incomplete orthogonal arrays (Q1255007) (← links)
• On computer generation of balanced arrays (Q1257319) (← links)
• Cyclic orthogonal and balanced arrays (Q1361711) (← links)
• Comparisons of search designs using search probabilities (Q1611794) (← links)
• On existence and construction of balanced arrays (Q1802130) (← links)
• Some existence conditions for partially balanced arrays with 2 symbols (Q1821105) (← links)
• Balanced arrays from quadratic functions (Q1970848) (← links)
• Bounds on the number of constraints for balanced arrays of strength t (Q2277471) (← links)
• Further investigations on balanced arrays (Q2365201) (← links)
• Linear programming bounds for balanced arrays (Q2433839) (← links)
• Existence Conditions for Balanced Fractional 2^mFactorial Designs of Resolution 2l + 1 Derived from Simple Arrays (Q3462384) (← links)
• Norm of alias atrices for (l + 1)-factor interactions in balanced fractional 2^Mfactorial designs of resolution 2 l+1 (Q3716118) (← links)
• Balanced 2^mfactorial designs of resolution v which allow search and estimation of one extra unknown effect, 4 ≤ m ≤ 8 (Q4140219) (← links)
• Characterization of singular balanced fractional s^mfactorial designs derivable from balanced arrays with maximum number of constraints (Q4202708) (← links)