OOA with Large Number of Runs

A linear ordered orthogonal array OOA(b^m, s,F_b, 2, m) with arbitrarily large s exists for all m large enough.

If m is even, one can use the complete OOA OOA(b^m, m/2,F_b, 2, m) yielding s = m/2.

If m is odd, one can use the dual of the NRT-repetition code [((m + 1)/2, 2), 1, m + 1], which is a linear OOA(b^m,(m + 1)/2,F_b, 2, m) yielding s = (m + 1)/2.

Copyright

Copyright © 2004, 2005, 2006, 2007, 2008, 2009, 2010 by Rudolf Schürer and Wolfgang Ch. Schmid.
Cite this as: Rudolf Schürer and Wolfgang Ch. Schmid. “OOA with Large Number of Runs.” From MinT—the database of optimal net, code, OA, and OOA parameters. Version: 2015-09-03. http://mint.sbg.ac.at/desc_OMInfSInf.html