A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets

DOI10.4153/CMB-1999-042-xzbMath0927.05014MaRDI QIDQ4267614

Douglas R. Stinson, William J. Martin

Publication date: 5 December 1999

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

zbMATH Keywords

quasi-Monte Carloordered orthogonal arraysRao bound

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Probabilistic methods, stochastic differential equations (65C99)

Related Items (6)

Mixed orthogonal arrays, \((u,m,\mathbf{e},s)\)-nets, and \((u,\mathbf{e},s)\)-sequences ⋮ A direct approach to linear programming bounds for codes and tms-nets ⋮ Existence of small ordered orthogonal arrays ⋮ Finite field constructions of combinatorial arrays ⋮ MinT-architecture and applications of the \((t, m, s)\)-net and OOA database ⋮ Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences

This page was built for publication: A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets