On arrays with some combinatorial structure
From MaRDI portal
Publication:1842160
DOI10.1016/0012-365X(94)00138-9zbMath0822.05009OpenAlexW2074696545MaRDI QIDQ1842160
Publication date: 28 September 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00138-9
Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15)
Cites Work
- Arrays of strength s on two symbols
- Optimality of some weighing and \(2^n\) fractional factorial designs
- Contributions to the theory and construction of balanced arrays
- Incomplete block designs through orthogonal and incomplete orthogonal arrays
- Bounds on the number of constraints for balanced arrays of strength t
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- On the maximum number of constraints for s-symbol balanced arrays of strength t
- On Orthogonal Arrays
- Generalized Hadamard Matrices and Orthogonal Arrays of Strength Two
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
- Orthogonal Arrays of Index Unity
- Orthogonal Arrays of Strength two and three
- On the Maximum Number of Constraints of an Orthogonal Array
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On arrays with some combinatorial structure