|
Title
|
|
|
|
Complete enumeration of pure-level and mixed-level orthogonal arrays
| |
|
Author
|
|
|
|
| |
|
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 implementation in C, we generate most non-trivial series for t=2, N28, t=3, N64, and t=4, N168. The exceptions define limiting run-sizes for which the algorithm returns complete sets in a reasonable amount of time. |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
Journal of combinatorial designs. - New York, N.Y., 1993, currens
| |
|
Publication
|
|
|
|
New York, N.Y.
:
Wiley-Interscience
,
2010
| |
|
ISSN
|
|
|
|
1063-8539
[print]
1520-6610
[online]
| |
|
DOI
|
|
|
|
10.1002/JCD.20236
| |
|
Volume/pages
|
|
|
|
18
:2
(2010)
, p. 123-140
| |
|
ISI
|
|
|
|
000275030700005
| |
|
Full text (Publisher's DOI)
|
|
|
|
| |
|