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