Bounds on the number of constraints for balanced arrays of strength t
From MaRDI portal
Publication:2277471
DOI10.1016/0378-3758(88)90010-9zbMath0725.05023OpenAlexW2012938435MaRDI QIDQ2277471
Rahul Mukerjee, Sanpei Kageyama, Gour Mohan Saha
Publication date: 1988
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0378-3758(88)90010-9
Orthogonal arrays, Latin squares, Room squares (05B15) Statistical block designs (62K10) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Related Items (6)
FURTHER CONSTRUCTION OF BALANCED ARRAYS ⋮ An extension method for balanced arrays ⋮ Bounds on the number of constraints for balanced arrays of strength t ⋮ On existence and construction of balanced arrays ⋮ Characterization of singular balanced fractional smfactorial designs derivable from balanced arrays with maximum number of constraints ⋮ On arrays with some combinatorial structure
Cites Work
- Arrays of strength s on two symbols
- On some optimal fractional \(2^ m \)factorial designs of resolution V
- Balanced arrays of strength 4 and balanced fractional \(3^m\) factorial designs
- Characteristic polynomials of the information matrices of balanced fractional \(3^ m\) factorial designs of resolution V
- Contributions to the theory and construction of balanced arrays
- Optimal balanced \(2^7\) fractional factorial designs of resolution \(v\), with \(N\leq 42\)
- Optimal balanced fractional \(2^m\) factorial designs of resolution VII, \(6\leq m\leq 8\)
- Note on balanced fractional \(2^m\) factorial designs of resolution \(2l+1\)
- Balanced arrays of strength 21 and balanced fractional \(2^m\) factorial designs
- Bounds on the number of constraints for balanced arrays of strength t
- Some general existence conditions for balanced arrays of strength \(t\) and 2 symbols
- On Some Methods of Construction of Partially Balanced Arrays
- A note on an upper bound for the constraints of balancedarrays with strength t
- On the maximum number of constraints for s-symbol balanced arrays of strength t
- Balanced 2mfactorial designs of resolution v which allow search and estimation of one extra unknown effect, 4 ≤ m ≤ 8
- Balanced Optimal 2 m Fractional Factorial Designs of Resolution V, m <= 6
- On the Characteristic Roots of the Information Matrix of $2^m$ Balanced Factorial Designs of Resolution V, with Applications
- Optimal balanced 27fractional factorial designs of resolution V, 49 ≤ N ≤55
- Unnamed Item
- Unnamed Item
- 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: Bounds on the number of constraints for balanced arrays of strength t
