𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear programming bound for orthogonal arrays with mixed levels

✍ Scribed by N.J.A. Sloane; J. Stufken

Book ID
104340218
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
451 KB
Volume
56
Category
Article
ISSN
0378-3758

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

A large index theorem for orthogonal arr
A large index theorem for orthogonal arrays, with bounds
✍ Steven J. Rosenberg πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 131 KB

It is shown that for fixed v,k, and t, an orthogonal array A, (v,k, 2) exists for ~2k-21) 2k-t. Information on the number of orthogonal arrays with given parameters, as a function of 2, is also obtained. In this paper v,k, and t will be fixed integers satisfying v>~2 and 1 <~t<~k. Let Iv] denote t