𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Arrays of strength s on two symbols

✍ Scribed by J.Q. Longyear

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
571 KB
Volume
10
Category
Article
ISSN
0378-3758

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Products of mixed covering arrays of str
Products of mixed covering arrays of strength two
✍ Charles J. Colbourn; Sosina S. Martirosyan; Gary L. Mullen; Dennis Shasha; Georg πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 208 KB

## Abstract A __covering array__ __CA__(__N__;__t__,__k__, __v__ is an __N__ × __k__ array such that every __N__ × __t__ subarray contains all __t__‐tuples from __v__ symbols __at least__ once, where __t__ is the __strength__ of the array. Covering arrays are used to generate software test suites t

Balanced arrays of strength two from blo
Balanced arrays of strength two from block designs
✍ Kishore Sinha; Vanshi Dhar; G. M. Saha; Sanpei Kageyama πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 103 KB

## Abstract Some constructions of balanced arrays of strength two are provided by use of rectangular designs, group divisible designs, and nested balanced incomplete block designs. Some series of such arrays are also presented as well as orthogonal arrays, with illustrations. Β© 2002 Wiley Periodica