## OOA Stacking with Additional Row

Let A denote a (linear) ordered orthogonal array OOA(*M*, *s*, *S*_{b}, *T *, *k*) with *T * ≥ ⌊*k*/2⌋. Then a (linear) OOA(*M*, *s* – 1, *S*_{b}, *T *ʹ, *k*) can be constructed for any *T *ʹ ≤ 3*T *. If *M* = *b*^{m} and *T * is chosen as *T * = *k* (which is always possible), a (digital) (*m*−*k*, *m*, *s*−1)-net in base *b* is obtained.

For *T * = 1 and *k* = 3 the result in the linear case is due to [1, Theorem 2] and [2, Theorem 1], the non-linear case to [1, Theorem 6] and [3, Theorem 6.2.1].

### Construction

The OOA Aʹ is constructed as follows based on A: Let *σ* denote a permutation of {1,…, *s*ʹ} without fixed points. Then the *i*th factor of Aʹ is constructed as

*x*

_{i,1},…,

*x*

_{i,T },

*x*

_{s,1},…,

*x*

_{s,T },

*x*

_{σ(i), T},…,

*x*

_{σ(i), 1})

for *i* = 1,…, *s*−1 based on (*x*_{1,1},…, *x*_{1,T }| ⋯ | *x*_{s,1},…, *x*_{s,T }) ∈ A.

Note that the first *T * levels of Aʹ are obtained by discarding a factor from A . The discarded factor of A is copied into all factors of Aʹ for the next *T * levels. Finally, the last *T * levels are a factor-wise permuted and level-wise reversed copy of the first *T * levels.

### See Also

Part of Construction 17 in [4].

### References

[1] | Wolfgang Ch. Schmid.(.t, m, s)-Nets: Digital Construction and Combinatorial AspectsPhD thesis, University of Salzburg, Austria, 1995. |

[2] | Kenneth Mark Lawrence, Arijit Mahalanabis, Gary L. Mullen, and Wolfgang Ch. Schmid. Construction of digital ( t, m, s)-nets from linear codes.In S. D. Cohen and Harald Niederreiter, editors, Finite Fields and Applications, volume 233 of Lect. Note Series of the London Math. Soc., pages 189–208. Cambridge University Press, 1996. |

[3] | Kenneth Mark Lawrence.Combinatorial Bounds and Constructions in the Theory of Uniform Point Distributions in Unit Cubes, Connections with Orthogonal Arrays and a Poset Generalization of a Related Problem in Coding Theory.PhD thesis, University of Wisconsin, Madison, 1995. |

[4] | Andrew T. Clayman, Kenneth Mark Lawrence, Gary L. Mullen, Harald Niederreiter, and Neil J. A. Sloane. Updated tables of parameters of ( t, m, s)-nets.Journal of Combinatorial Designs, 7(5):381–393, 1999.doi:10.1002/(SICI)1520-6610(1999)7:5<381::AID-JCD7>3.0.CO;2-S MR1702298 (2000d:05014) |

### 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 Stacking with Additional Row.”
From MinT—the database of optimal net, code, OA, and OOA parameters.
Version: 2008-04-04.
http://mint.sbg.ac.at/desc_OStackingWithAdditionalRow.html