Orthogonal arrays. Theory and applications
From MaRDI portal
Publication:1297378
zbMath0935.05001MaRDI QIDQ1297378
A. S. Hedayat, N. J. A. Sloane, John Stufken
Publication date: 9 August 1999
Published in: Springer Series in Statistics (Search for Journal in Brave)
design of experimentstextbookHadamard matriceslinear codesorthogonal arraysnetderandomizationerror-correcting codesresilient functionsBusch constructionRao boundsstrongly universal hash families
Design of statistical experiments (62K99) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Linear codes (general theory) (94B05) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items (only showing first 100 items - show all)
Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ Construction of generalized minimum aberration three-level orthogonal arrays with three, four and five columns ⋮ Two-weight codes, graphs and orthogonal arrays ⋮ Construction of component orthogonal arrays with any number of components ⋮ Construction of space-filling orthogonal designs ⋮ Uniform semi-Latin squares and their pairwise-variance aberrations ⋮ Quarter-fraction factorial designs constructed via quaternary codes ⋮ Mixed orthogonal arrays, \((u,m,\mathbf{e},s)\)-nets, and \((u,\mathbf{e},s)\)-sequences ⋮ A construction and decomposition of orthogonal arrays with non-prime-power numbers of symbols on the complement of a Baer subplane ⋮ Fast approximately balanced bootstrap without construction ⋮ Resolvable generalized difference matrices: existence and applications ⋮ On the classification of self-dual \([20,10,9\) codes over \(\mathrm{GF}(7)\)] ⋮ Roux-type constructions for covering arrays of strengths three and four ⋮ Nonexistence of binary orthogonal arrays via their distance distributions ⋮ Observability of lattice graphs ⋮ Scheduling a single vehicle in the just-in-time part supply for a mixed-model assembly line ⋮ Construction of nested orthogonal arrays of parallel-flats type ⋮ Optimal and efficient designs for functional brain imaging experiments ⋮ Projection properties of Hadamard matrices of order 36 obtained from Paley's constructions ⋮ A simple method for constructing orthogonal arrays by the Kronecker sum ⋮ Blocked regular fractional factorial designs with minimum aberration ⋮ An approach of constructing mixed-level orthogonal arrays of strength \(\geqslant 3\) ⋮ The nonexistence of projective planes of order 12 with a collineation group of order 16 ⋮ Some mixed orthogonal arrays obtained by orthogonal projection matrices ⋮ A simple combinatorial treatment of constructions and threshold gaps of ramp schemes ⋮ A new lower bound to \(A_{2}\)-optimality measure for multi-level and mixed-level column balanced designs and its applications ⋮ Subset selection from large datasets for kriging modeling ⋮ Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions ⋮ Generalized packing designs ⋮ Multimagic rectangles based on large sets of orthogonal arrays ⋮ Constructing \(D\)-optimal symmetric stated preference discrete choice experiments ⋮ A cyclic construction of saturated and supersaturated designs ⋮ Resolvable orthogonal array-based uniform sliced Latin hypercube designs ⋮ On the existence of orthogonal arrays OA\((3,5,4n+2)\) ⋮ Some new results on mutually orthogonal frequency squares ⋮ Optimal experimental designs for fMRI via circulant biased weighing designs ⋮ Classification of difference matrices over cyclic groups ⋮ A construction for strength-3 covering arrays from linear feedback shift register sequences ⋮ On the construction of asymmetric orthogonal arrays ⋮ A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices ⋮ Complementary design theory for sliced equidistance designs ⋮ Generating and improving orthogonal designs by using mixed integer programming ⋮ Construction of minimum generalized aberration two-level orthogonal arrays ⋮ Construction of optimal supersaturated design with large number of levels ⋮ Finite field constructions of combinatorial arrays ⋮ Construction of equidistant and weak equidistant supersaturated designs ⋮ A note on connections among criteria for asymmetrical factorials ⋮ The triple distribution of codes and ordered codes ⋮ Some new classes of orthogonal Latin hypercube designs ⋮ Accurate emulators for large-scale computer experiments ⋮ Creating catalogues of two-level nonregular fractional factorial designs based on the criteria of generalized aberration ⋮ Optimization for simulation: LAD accelerator ⋮ A characterization of strong orthogonal arrays of strength three ⋮ On the construction of nested space-filling designs ⋮ Optimum mixed level detecting arrays ⋮ Constructing strength three covering arrays with augmented annealing ⋮ Space-filling Latin hypercube designs based on randomization restrictions in factorial experiments ⋮ Sliced space-filling designs with different levels of two-dimensional uniformity ⋮ Optimal designs for mixed models in experiments based on ordered units ⋮ Performance of cubature formulae in probabilistic model analysis and optimization ⋮ Classification of three-level strength-3 arrays ⋮ On the power of non-adaptive learning graphs ⋮ A multivariate central limit theorem for randomized orthogonal array sampling designs in computer experiments ⋮ Good equidistant codes constructed from certain combinatorial designs ⋮ On the existence of nested orthogonal arrays ⋮ A construction of \(\mathrm{OA}(s^t,t+1,s,t)\) by nonlinear functions and some classification for \(s=4\) ⋮ Energy bounds for codes and designs in Hamming spaces ⋮ Tabu search for covering arrays using permutation vectors ⋮ Nonexistence of a few binary orthogonal arrays ⋮ \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays ⋮ Efficient paired choice designs with fewer choice pairs ⋮ Hydrodynamic interactions of water waves with a group of independently oscillating truncated circular cylinders ⋮ Constructions of new orthogonal arrays and covering arrays of strength three ⋮ New explicit bounds for ordered codes and \((t,m,s)\)-nets ⋮ Optimality results on orthogonal arrays plus \(p\) runs for \(s^m\) factorial experiments ⋮ 2-level fractional factorial designs which are the union of non trivial regular designs ⋮ Finding optimal designs in the presence of trends ⋮ Cubic and higher degree bounds for codes and \((t,m,s)\)-nets ⋮ Orthogonal arrays obtained by generalized difference matrices with \(g\) levels ⋮ On construction of optimal mixed-level supersaturated designs ⋮ A new and flexible method for constructing designs for computer experiments ⋮ Recent developments in nonregular fractional factorial designs ⋮ Affine designs and linear orthogonal arrays ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Construction of nested orthogonal arrays ⋮ Box-Hunter resolution in nonregular fractional factorial designs ⋮ Robust tolerance design for function generation mechanisms with joint clearances ⋮ Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints ⋮ Optimal and near-optimal mixed covering arrays by column expansion ⋮ Linear error-block codes ⋮ Constructions and bounds on linear error-block codes ⋮ Type 1 optimal \(2^m\) fractional factorial plans with \(n\equiv\ell \pmod 8\) runs, \(\ell=1,2\) ⋮ 18-run nonisomorphic three level orthogonal arrays ⋮ An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays ⋮ Standing on the shoulders of a giant: the life and work of Samad Hedayat ⋮ Optimal designs for multiple treatments with unequal variances ⋮ A class of mixed orthogonal arrays obtained from projection matrix inequalities ⋮ Binary consecutive covering arrays ⋮ Construction of a new class of orthogonal arrays ⋮ Construction of optimal multi-level supersaturated designs
This page was built for publication: Orthogonal arrays. Theory and applications
