Trivial Upper Bound on m

For given t, s, and b a (t, s)-sequence in base b is the largest “net” (in terms of size m) considered by MinT. Therefore, not ruling out the existence of such a sequence is a trivial upper bound on m.

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. “Trivial Upper Bound on m.” From MinT—the database of optimal net, code, OA, and OOA parameters. Version: 2008-04-04. http://mint.sbg.ac.at/desc_NBoundTrivialM.html

Show usage of this method