Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4646613 | Discrete Mathematics | 2016 | 10 Pages |
Abstract
We study the classes of (u,m,e,s)-nets and (u,e,s)-sequences, which are generalizations of (u,m,s)(u,m,s)-nets and (u,s)(u,s)-sequences, respectively. We show equivalence results that link the existence of (u,m,e,s)-nets and so-called mixed (ordered) orthogonal arrays, thereby generalizing earlier results by Lawrence, and Mullen and Schmid. We use this combinatorial equivalence principle to obtain new results on the possible parameter configurations of (u,m,e,s)-nets and (u,e,s)-sequences, which generalize in particular a result of Martin and Stinson.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Peter Kritzer, Harald Niederreiter,