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

DOI10.4153/CMB-1999-042-XMaRDI QIDQ4267614zbMATH OpenFDO

Authors William J. Martin, D. R. Stinson

Publication date 5 December 1999

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

Full work available at URL https://doi.org/10.4153/CMB-1999-042-X

zbMATH Keywords

ordered orthogonal arraysquasi-Monte CarloRao bound

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1229678
• New explicit bounds for ordered codes and (t,m,s)-nets
• Constructions of nets via OAs of strength 3 with a prescribed property
• A Dual Plotkin Bound for (T,M,S)-Nets

Cited in

(12)

• On orthogonal arrays attaining Rao's bounds
• A direct approach to linear programming bounds for codes and tms-nets
• Constructions of (t,m,s)-nets and (t,s)-sequences
• Mixed orthogonal arrays, \((u,m,\mathbf{e},s)\)-nets, and \((u,\mathbf{e},s)\)-sequences
• Constructions of nets via OAs of strength 3 with a prescribed property
• An asymptotic {G}ilbert-{V}arshamov bound for \((T,M,S)\)-nets
• A Dual Plotkin Bound for (T,M,S)-Nets
• scientific article; zbMATH DE number 1229678 (Why is no real title available?)
• scientific article; zbMATH DE number 1390119 (Why is no real title available?)
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4267614)