An equivalence between \((T,M,S)\)-nets and strongly orthogonal hypercubes

DOI10.1006/jcta.1996.0098zbMath0860.05012OpenAlexW2078062550MaRDI QIDQ1924247

Wolfgang Ch. Schmid, Gary L. Mullen

Publication date: 21 April 1997

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1996.0098

zbMATH Keywords

netsorthogonal arraysstrongly orthogonal hypercubes

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Orthogonal arrays, Latin squares, Room squares (05B15) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (15)

Mixed orthogonal arrays, \((u,m,\mathbf{e},s)\)-nets, and \((u,\mathbf{e},s)\)-sequences ⋮ Existence of small ordered orthogonal arrays ⋮ Ordered covering arrays and upper bounds on covering codes ⋮ Finite field constructions of combinatorial arrays ⋮ The triple distribution of codes and ordered codes ⋮ A characterization of strong orthogonal arrays of strength three ⋮ Unnamed Item ⋮ New explicit bounds for ordered codes and \((t,m,s)\)-nets ⋮ Unnamed Item ⋮ Cubic and higher degree bounds for codes and \((t,m,s)\)-nets ⋮ MinT-architecture and applications of the \((t, m, s)\)-net and OOA database ⋮ Construction results for strong orthogonal arrays of strength three ⋮ A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays ⋮ Constructions of nets via OAs of strength 3 with a prescribed property ⋮ Orthogonal hypercubes and related designs

This page was built for publication: An equivalence between \((T,M,S)\)-nets and strongly orthogonal hypercubes