Orthogonal Arrays of Strength two and three
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Construction of nested space-filling designs
- On qualitatively independent partitions and related problems
- Some techniques for constructing infinite families of BIBD's
- A recursive construction of 1-rotational Steiner 2-designs
- Maximal difference matrices of order \(\leq 10\)
- On orthogonal arrays attaining Rao's bounds
- On difference matrices, transversal designs, resolvable transversal designs and large sets of mutually orthogonal F-squares
- Hermitian congruence and the existence of completion of generalized Hadamard matrices
- Algebraic theory of block codes detecting independent errors
- Embedding of orthogonal arrays of strength two and deficiency greater than two
- Partial t-spreads and group constructible \((s,r,\mu)\)-nets
- An embedding theorem for affine resolvable designs
- Translations of symmetric and complete nets
- Translations and construction of generalised nets
- Polynomial representations of complete sets of frequency hyperrectangles with prime power dimensions
- On two level symmetrical factorial designs
- Affine resolvable balanced incomplete block designs: a survey
- On difference matrices, resolvable transversal designs and generalized Hadamard matrices
- Incomplete block designs through orthogonal and incomplete orthogonal arrays
- Properties of complete sets of mutually equiorthogonal frequency hypercubes
- Orthogonal factorial design of parallel flats type and its application in biomedical research
- On balanced orthogonal multi-arrays: Existence, construction and application to design of experiments
- 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
- Beyond the orthogonal array concept.
- Sign-balanced covering matrices
- Construction of generalized Hadamard matrices \(D(r^m(r+1),r^m(r+1);p)\)
- Automatic generation of generalised regular factorial designs
- Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3
- Recursive constructions for cyclic BIB designs and their generalizations
- On arrays with some combinatorial structure
- A note on uniformity and orthogonality
- Optimal fractional factorial plans for main effects and specified two-factor interactions: A projective geometric approach
- A construction for Steiner 3-designs
- Mixed difference matrices and the construction of orthogonal arrays
- A survey of orthogonal arrays of strength two
- Construction of some asymmetrical orthogonal arrays
- On the existence of saturated and nearly saturated asymmetrical orthogonal arrays
- Invariant codes, difference schemes, and distributive quasigroups
- Construction of orthogonal arrays without interaction columns
- Construction of symmetric orthogonal designs with deep Q-network and orthogonal complementary design
- A new and flexible design construction for orthogonal arrays for modern applications
- Multi-objective cellular particle swarm optimization and RBF for drilling parameters optimization
- On distance distributions of orthogonal arrays
- The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)
- Supersaturated designs for asymmetrical factorial experiments
- Further investigations on balanced arrays
- An effective algorithm for generation of factorial designs with generalized minimum aberration
- Optimal fractional factorial plans using minihypers
- Orthogonal arrays of strength 3 and small run sizes
- A vector-space packing problem
- Unbalanced Hadamard matrices and finite projective planes of even order
- Some general existence conditions for balanced arrays of strength \(t\) and 2 symbols
- A class of mixed orthogonal arrays obtained from projection matrix inequalities
- Orthogonal and partially balanced arrays and their application in design of experiments
- Construction of a new class of orthogonal arrays
- High-dimensional black-box optimization under uncertainty
- On bi-level orthogonal arrays of strength four
- A family of partial geometric designs from three-class association schemes
- Direct constructions of additive codes
- An extension method for balanced arrays
- Resolvable generalized difference matrices: existence and applications
- A note on an upper bound for the constraints of balancedarrays with strength t
- Construction of nested orthogonal arrays of parallel-flats type
- Optimal Fractional Factorial Plans Using Finite Projective Geometry
- GeneralizedE(s2) Criterion for Multilevel Supersaturated Designs
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- A cyclic construction of saturated and supersaturated designs
- On the construction of balanced and orthogonal arrays
- Characterization of singular balanced fractional smfactorial designs derivable from balanced arrays with maximum number of constraints
- scientific article; zbMATH DE number 1290174 (Why is no real title available?)
- Combinatorial coverings from geometries over principal ideal rings
- On construction of some new symmetric and asymmetric orthogonal arrays
- Replication procedure for grouped Sobol' indices estimation in dependent uncertainty spaces
- A characterization of strong orthogonal arrays of strength three
- On the construction of nested space-filling designs
- Further construction of balanced arrays
- Quantum combinatorial designs and \(k\)-uniform states
- Construction of some new families of nested orthogonal arrays
- Some results on the construction of sliced orthogonal arrays of parallel-flats type
- Construction of optimal supersaturated designs via generalized Hadamard matrices
- Orthogonal arrays and designs for partial triallel crosses
- Set-codes with small intersections and small discrepancies
- Orthogonal plans of resolution IV and V
- Asymmetrical orthogonal arrays with run size 100
- A scientific tour on orthogonal arrays
- A Logic-Based Approach to Combinatorial Testing with Constraints
- Orthogonal arrays obtained by generalized difference matrices with \(g\) levels
- On construction of optimal mixed-level supersaturated designs
- An inner orthogonality of Hadamard matrices
- Orthogonal arrays of strength five
- Mutually unbiased maximally entangled bases from difference matrices
- On a composition of cyclic 2-designs
- 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
This page was built for publication: Orthogonal Arrays of Strength two and three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5813930)