Strength Reduction for OOAs

It follows directly from the definition of ordered orthogonal arrays that every (linear) OOA(M, s, S_b, T , k) is also a (linear) OOA(M, s, S_b, T , kʹ) for all kʹ = 0,…, k.

In the context of NRT-codes, every (linear) ((s, T ), N, d)-code is also a (linear) ((s, T ), N, dʹ)-code over the same alphabet for all dʹ = 1,…, d.

See Also

• Special case for orthogonal arrays and codes

• For T →∞ one obtains the corresponds result for nets (t-expansion)

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. “Strength Reduction for OOAs.” From MinT—the database of optimal net, code, OA, and OOA parameters. Version: 2024-09-05. http://mint.sbg.ac.at/desc_OKRed.html