Abstract
We show how the Delsarte theory can be used to obtain a linear programming bound for orthogonal arrays with mixed levels. Even for strength 2 this improves on the Rao bound in a large number of cases. The results point to several interesting sets of parameters for which the existence of the arrays is at present undecided.
Original language | English (US) |
---|---|
Pages (from-to) | 295-305 |
Number of pages | 11 |
Journal | Journal of Statistical Planning and Inference |
Volume | 56 |
Issue number | 2 |
DOIs | |
State | Published - Dec 15 1996 |
Keywords
- Asymmetric orthogonal arrays
- Linear programming bound
- Mixed orthogonal arrays
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Applied Mathematics