Complete enumeration of pure-level and mixed-level orthogonal arrays
article
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, N≥28, t = 3, N≥64, and t = 4,N≥168. The exceptions define limiting run-sizes for which the algorithm returns complete sets in a reasonable amount of time.
TNO Identifier
290657
ISSN
10638539
Source
Journal of Combinatorial Designs, 18(2), pp. 123-140.
Publisher
Wiley
Place of publication
New York
Pages
123-140
Files
To receive the publication files, please send an e-mail request to TNO Repository.