Constructions of nets via OAs of strength 3 with a prescribed property

The idea of (t, m, s)‐nets was proposed by Niederreiter in 1987. Such nets are highly uniform point distributions in s‐dimensional unit cubes and useful in numerical analysis. It is by now well known that (t, m, s)‐nets can be equivalently described in terms of ordered orthogonal arrays (OOAs). In this article, we describe an equivalence between an OOA and an orthogonal array (OA) with all its derived orthogonal subarrays being resolvable. We then present a number of constructions for OAs where all their derived orthogonal subarrays are resolvable. These results are finally combined to give new series of (t, m, s)‐nets. © 2010 Wiley Periodicals, Inc. J Combin Designs 19:144‐155, 2011