scientific article; zbMATH DE number 1229678
From MaRDI portal
Publication:4222121
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(1996)4:4<275::AID-JCD5>3.0.CO;2-C" /><275::AID-JCD5>3.0.CO;2-C 10.1002/(SICI)1520-6610(1996)4:4<275::AID-JCD5>3.0.CO;2-CzbMath0911.05023MaRDI QIDQ4222121
Publication date: 16 May 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Monte Carlo methods (65C05) Orthogonal arrays, Latin squares, Room squares (05B15) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (14)
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 ⋮ A characterization of strong orthogonal arrays of strength three ⋮ Sudoku-like arrays, codes and orthogonality ⋮ 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 ⋮ Constructions of nets via OAs of strength 3 with a prescribed property ⋮ Latin hypercube designs based on strong orthogonal arrays and Kriging modelling to improve the payload distribution of trains
This page was built for publication:
