Orthogonal Arrays of Strength two and three
From MaRDI portal
Publication:5813930
DOI10.1214/aoms/1177729331zbMath0048.00803OpenAlexW2009445227MaRDI QIDQ5813930
Publication date: 1952
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177729331
Optimal statistical designs (62K05) Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items (only showing first 100 items - show all)
An inner orthogonality of Hadamard matrices ⋮ Orthogonal arrays of strength five ⋮ Covering schemes of strength \(t\) ⋮ On the construction of some new asymmetric orthogonal arrays ⋮ Constructions for new orthogonal arrays based on large sets of orthogonal arrays ⋮ New bound and constructions for geometric orthogonal codes and geometric 180-rotating orthogonal codes ⋮ A unifying implementation of stratum (aka strong) orthogonal arrays ⋮ On codes with distances \(d\) and \(n\) ⋮ Construction of optimal supersaturated designs by the expansive replacement method ⋮ Orthogonal plans of resolution IV and V ⋮ Unnamed Item ⋮ A Logic-Based Approach to Combinatorial Testing with Constraints ⋮ Asymmetrical Orthogonal Arrays With Run Size 100 ⋮ A Scientific Tour on Orthogonal Arrays ⋮ Mutually unbiased maximally entangled bases from difference matrices ⋮ Optimal fractional factorial plans for main effects and specified two-factor interactions: A projective geometric approach ⋮ FURTHER CONSTRUCTION OF BALANCED ARRAYS ⋮ Further investigations on balanced arrays ⋮ Construction of symmetric orthogonal designs with deep Q-network and orthogonal complementary design ⋮ Orthogonal and partially balanced arrays and their application in design of experiments ⋮ Quantum combinatorial designs and k-uniform states ⋮ A construction for Steiner 3-designs ⋮ Neural network and regression spline value function approximations for stochastic dynamic programming ⋮ A new and flexible design construction for orthogonal arrays for modern applications ⋮ Resolvable generalized difference matrices: existence and applications ⋮ On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2 ⋮ Cyclic orthogonal and balanced arrays ⋮ Classification of affine resolvable \(2\)-\((27,9,4)\) designs ⋮ On difference schemes and orthogonal arrays of strength \(t\) ⋮ Construction of nested orthogonal arrays of parallel-flats type ⋮ On orthogonal arrays attaining Rao's bounds ⋮ Multi-objective cellular particle swarm optimization and RBF for drilling parameters optimization ⋮ A simple method for constructing orthogonal arrays by the Kronecker sum ⋮ On difference matrices, transversal designs, resolvable transversal designs and large sets of mutually orthogonal F-squares ⋮ Automatic generation of generalised regular factorial designs ⋮ Orthogonal arrays obtained by repeating-column difference matrices ⋮ Construction of some new families of nested orthogonal arrays ⋮ Some results on the construction of sliced orthogonal arrays of parallel-flats type ⋮ On a composition of cyclic 2-designs ⋮ Hermitian congruence and the existence of completion of generalized Hadamard matrices ⋮ Construction of optimal supersaturated designs via generalized Hadamard matrices ⋮ Mixed difference matrices and the construction of orthogonal arrays ⋮ A survey of orthogonal arrays of strength two ⋮ Orthogonal arrays and designs for partial triallel crosses ⋮ Construction of some asymmetrical orthogonal arrays ⋮ On the existence of saturated and nearly saturated asymmetrical orthogonal arrays ⋮ An extension method for balanced arrays ⋮ Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions ⋮ High-dimensional black-box optimization under uncertainty ⋮ Algebraic theory of block codes detecting independent errors ⋮ A cyclic construction of saturated and supersaturated designs ⋮ Embedding of orthogonal arrays of strength two and deficiency greater than two ⋮ A formal logic approach to constrained combinatorial testing ⋮ Partial t-spreads and group constructible \((s,r,\mu)\)-nets ⋮ On distance distributions of orthogonal arrays ⋮ A Family of Partial Geometric Designs from Three-Class Association Schemes ⋮ Set-Codes with Small Intersections and Small Discrepancies ⋮ Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3 ⋮ Replication procedure for grouped Sobol' indices estimation in dependent uncertainty spaces ⋮ Orthogonal arrays obtainable as solutions to linear equations over finite fields ⋮ An embedding theorem for affine resolvable designs ⋮ Translations of symmetric and complete nets ⋮ Translations and construction of generalised nets ⋮ A characterization of strong orthogonal arrays of strength three ⋮ On the construction of nested space-filling designs ⋮ Beyond the orthogonal array concept. ⋮ On the construction of \(q\)-ary equidistant codes ⋮ On the existence of nested orthogonal arrays ⋮ An effective algorithm for generation of factorial designs with generalized minimum aberration ⋮ Almost MDS codes ⋮ Unnamed Item ⋮ The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\) ⋮ Polynomial representations of complete sets of frequency hyperrectangles with prime power dimensions ⋮ Orthogonal arrays obtained by generalized difference matrices with \(g\) levels ⋮ On construction of optimal mixed-level supersaturated designs ⋮ Optimal fractional factorial plans using minihypers ⋮ On construction of some new symmetric and asymmetric orthogonal arrays ⋮ Construction of nested orthogonal arrays ⋮ On two level symmetrical factorial designs ⋮ A note on an upper bound for the constraints of balancedarrays with strength t ⋮ Affine resolvable balanced incomplete block designs: a survey ⋮ On the construction of balanced and orthogonal arrays ⋮ Orthogonal arrays of strength 3 and small run sizes ⋮ Some families of asymmetric nested orthogonal arrays and asymmetric sliced orthogonal arrays ⋮ On difference matrices, resolvable transversal designs and generalized Hadamard matrices ⋮ Incomplete block designs through orthogonal and incomplete orthogonal arrays ⋮ Recursive constructions for cyclic BIB designs and their generalizations ⋮ Combinatorial coverings from geometries over principal ideal rings ⋮ A vector-space packing problem ⋮ Unbalanced Hadamard matrices and finite projective planes of even order ⋮ Optimal Fractional Factorial Plans Using Finite Projective Geometry ⋮ Characterization of singular balanced fractional smfactorial designs derivable from balanced arrays with maximum number of constraints ⋮ Some general existence conditions for balanced arrays of strength \(t\) and 2 symbols ⋮ GeneralizedE(s2) Criterion for Multilevel Supersaturated Designs ⋮ Supersaturated designs for asymmetrical factorial experiments ⋮ Construction of nested space-filling designs ⋮ Properties of complete sets of mutually equiorthogonal frequency hypercubes ⋮ On arrays with some combinatorial structure ⋮ Some tuple system constructions with applications to resolvable designs ⋮ Sign-balanced covering matrices
This page was built for publication: Orthogonal Arrays of Strength two and three
