The lattice of \(N\)-run orthogonal arrays
DOI10.1016/S0378-3758(01)00119-7zbMath0989.62041arXivmath/0205299OpenAlexW1989359883WikidataQ60692077 ScholiaQ60692077MaRDI QIDQ1598712
Eric M. Rains, John Stufken, N. J. A. Sloane
Publication date: 28 May 2002
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0205299
mixed orthogonal arraylinear programming boundlinear orthogonal arrayasymmetrical orthogonal arrayexpansive replacement methodgeometric orthogonal arraymixed spreadtight array
Design of statistical experiments (62K99) Applications of mathematical programming (90C90) Linear programming (90C05) Orthogonal arrays, Latin squares, Room squares (05B15) Factorial statistical designs (62K15)
Related Items (max. 100)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of \(2^ m4^ n\) designs via a grouping scheme
- Orthogonal arrays. Theory and applications
- Classification of Hadamard matrices of order 28 with Hall sets
- Classification of Hadamard matrices of order 28
- A linear programming bound for orthogonal arrays with mixed levels
- The Magma algebra system. I: The user language
- On the spectrum of the sizes of maximal partial line spreads in \(\mathrm{PG}(2n,q)\), \(n \geq 3\)
- Quantum error correction via codes over GF(4)
This page was built for publication: The lattice of \(N\)-run orthogonal arrays