𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On existence of two symbol complete orthogonal arrays

✍ Scribed by Rahul Mukerjee; Sanpei Kageyama

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
285 KB
Volume
66
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Complete enumeration of pure-level and m
Complete enumeration of pure-level and mixed-level orthogonal arrays
✍ 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

The decomposability of simple orthogonal
The decomposability of simple orthogonal arrays on 3 symbols having t + 1 rows and strength t
✍ Wiebke S. Diestelkamp πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 155 KB

It is well-known that all orthogonal arrays of the form OANY t 1Y 2Y t are decomposable into ! orthogonal arrays of strength t and index 1. While the same is not generally true when s 3, we will show that all simple orthogonal arrays of the form OANY t 1Y 3Y t are also decomposable into orthogonal a

Correction to: Complete enumeration of p
Correction to: Complete enumeration of pure-level and mixed-level orthogonal arrays
✍ 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