𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parameter Inequalities for Orthogonal Arrays with Mixed Levels

✍ Scribed by Wiebke S. Diestelkamp


Book ID
111579114
Publisher
Springer
Year
2004
Tongue
English
Weight
121 KB
Volume
33
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A linear programming bound for orthogona
✍ N.J.A. Sloane; J. Stufken πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 451 KB

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 i

Complete enumeration of pure-level and m
✍ Eric D. Schoen; Pieter T. Eendebak; Man V. M. Nguyen πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 151 KB

## Abstract We specify an algorithm to enumerate a minimum complete set of combinatorially non‐isomorphic orthogonal arrays of given strength __t__, run‐size __N__, and level‐numbers of the factors. The algorithm is the first one handling general mixed‐level and pure‐level cases. Using an implement

Correction to: Complete enumeration of p
✍ Eric D. Schoen; Pieter T. Eendebak; Man V. M. Nguyen πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 32 KB

## Abstract We correct an error found in Schoen, Endebak, Nguyen, J Combin Designs 18 (2010), 123–140. Β© 2010 Wiley Periodicals, Inc. J Combin Designs 18: 488, 2010

On finding mixed orthogonal arrays of st
✍ Dean DeCock; John Stufken πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 69 KB

We describe a method for ΓΏnding mixed orthogonal arrays of strength 2 with a large number of 2-level factors. The method starts with an orthogonal array of strength 2, possibly tight, that contains mostly 2-level factors. By a computer search of this starting array, we attempt to ΓΏnd as large a numb