A linear programming bound for orthogonal arrays with mixed levels

N. J.A. Sloane, J. Stufken

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

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 languageEnglish (US)
Pages (from-to)295-305
Number of pages11
JournalJournal of Statistical Planning and Inference
Volume56
Issue number2
DOIs
StatePublished - 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

Fingerprint Dive into the research topics of 'A linear programming bound for orthogonal arrays with mixed levels'. Together they form a unique fingerprint.

Cite this