Pages that link to "Item:Q1297378"
From MaRDI portal
The following pages link to Orthogonal arrays. Theory and applications (Q1297378):
Displaying 50 items.
- On degree-\(d\) zero-sum sets of full rank (Q2202908) (← links)
- On tight 4-designs in Hamming association schemes (Q2216921) (← links)
- An appealing technique for designing optimal large experiments with three-level factors (Q2222067) (← links)
- Egalitarian Steiner triple systems for data popularity (Q2232127) (← links)
- Aspects of optimality of plans orthogonal through other factors and related multiway designs (Q2241653) (← links)
- Covering array EXtender (Q2242769) (← links)
- Column-orthogonal nearly strong orthogonal arrays (Q2242852) (← links)
- Uniformity of saturated orthogonal arrays (Q2242886) (← links)
- Strong orthogonal arrays of strength two-plus based on the Addelman-Kempthorne method (Q2244455) (← links)
- Construction of space-filling orthogonal Latin hypercube designs (Q2244562) (← links)
- Orthogonal subsampling for big data linear regression (Q2247473) (← links)
- Algebraic generation of minimum size orthogonal fractional factorial designs: an approach based on integer linear programming (Q2255781) (← links)
- Investigation of binary orthogonal arrays via their distance distributions (Q2262981) (← links)
- Improved WLP and GWP lower bounds based on exact integer programming (Q2266886) (← links)
- Consecutive covering arrays and a new randomness test (Q2266901) (← links)
- Batch sequential designs for computer experiments (Q2270267) (← links)
- Mixed covering arrays of strength three with few factors (Q2276196) (← links)
- Construction results for strong orthogonal arrays of strength three (Q2278667) (← links)
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces (Q2278701) (← links)
- Inter-class orthogonal main effect plans for asymmetrical experiments (Q2278861) (← links)
- On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays (Q2279982) (← links)
- Isomorphism check for \(2^n\) factorial designs with randomization restrictions (Q2300099) (← links)
- Cost-efficient mixed-level covering designs for testing experiments (Q2301219) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- Informing the structure of complex Hadamard matrix spaces using a flow (Q2305701) (← links)
- On unbalanced Boolean functions with best correlation immunity (Q2309213) (← links)
- Constructions of optimal orthogonal arrays with repeated rows (Q2312788) (← links)
- Energy bounds for codes in polynomial metric spaces (Q2318064) (← links)
- Resolvable covering arrays (Q2320870) (← links)
- Construction of search designs from orthogonal arrays (Q2320883) (← links)
- Two-factor saturated designs: cycles, Gini index, and state polytopes (Q2320889) (← links)
- Optimal designs for stated choice experiments generated from fractional factorial designs (Q2320909) (← links)
- On the \(A\) criterion of experimental design (Q2320914) (← links)
- Algebraic characterization of \(\mathbb{C}\)-regular fractions under level permutations (Q2322013) (← links)
- Construction of symmetric and asymmetric orthogonal arrays of strength \(t\) from orthogonal partition (Q2322992) (← links)
- Minimum aberration designs for discrete choice experiments (Q2324033) (← links)
- Hilbert bases for orthogonal arrays (Q2324035) (← links)
- A new class of designs for mixture-of-mixture experiments (Q2340387) (← links)
- Constructions of \(\Phi_p\)-optimal rotatable designs on the ball (Q2352343) (← links)
- Tower of covering arrays (Q2352791) (← links)
- \(\mathbb {Z}_{4}\)-codes and their Gray map images as orthogonal arrays (Q2364629) (← links)
- Further contributions to nonisomorphic two level orthogonal arrays (Q2370488) (← links)
- Designs containing partially clear main effects (Q2374578) (← links)
- Asymptotic enumeration of correlation-immune Boolean functions (Q2380852) (← links)
- Probabilistic existence of regular combinatorial structures (Q2400828) (← links)
- Marginally coupled designs for two-level qualitative factors (Q2407070) (← links)
- A simple approach to constructing quasi-Sudoku-based sliced space-filling designs (Q2409398) (← links)
- Mixed covering arrays on 3-uniform hypergraphs (Q2410218) (← links)
- Construction of marginally coupled designs by subspace theory (Q2419673) (← links)
- Optimum addition of information to computer experiments in view of uniformity and orthogonality (Q2421390) (← links)
