MinT-architecture and applications of the \((t, m, s)\)-net and OOA database
type: Item
instance of: scholarly article
title: MinT-architecture and applications of the \((t, m, s)\)-net and OOA database
zbMATH Open document ID: 1210.65008
author: Rudolf Schürer
author: Wolfgang Ch. Schmid
published in: Mathematics and Computers in Simulation
publication date: 2010-05-27T00:00:00Z
review text: MinT is a web-based database system for querying best known \((t,m,s)\)-net and \((t,s)\)-sequence parameters. It was developed by the authors. MinT is an acronym for ``minimal \(t\)'', referring to the common task of finding a \((t,m,s)\)-net with minimal \(t\) for given \(m\) and \(s\). In this article the authors present new features of MinT that have been introduced after the publication of their article [Refereed proceedings of the sixth international conference on Monte Carlo and quasi-Monte Carlo methods in scientific computation, Juan-les-Pins, France, June 7--10, 2004. Berlin: Springer, 457--469 (2006; Zbl 1130.65302)] and take a closer look at the architecture of MinT.
reviewed by: Yukio Ohkubo
Mathematics Subject Classification ID: 65C10
Mathematics Subject Classification ID: 11K45
zbMATH DE Number: 5712929
zbMATH Keywords: MinT
zbMATH Keywords: \((t,m,s)\)-net
zbMATH Keywords: Ordered orthogonal array (OOA)
zbMATH Keywords: Database
zbMATH Keywords: Quasi-Monte Carlo
describes a project that uses: MinT
MaRDI profile type: Publication
full work available at URL: j.matcom.2007.09.010
OpenAlex ID: W2164638483
cites work: A direct approach to linear programming bounds for codes and tms-nets
cites work: Coding‐theoretic constructions for (t,m,s)‐nets and ordered orthogonal arrays
cites work: Q4262994
cites work: Extensions of generalized product caps
cites work: Q4222121
cites work: Q4934386
cites work: A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets
cites work: A Dual Plotkin Bound for $(T,M,S)$-Nets
cites work: An equivalence between \((T,M,S)\)-nets and strongly orthogonal hypercubes
cites work: Point sets and sequences with small discrepancy
cites work: Q4003879
cites work: Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences
cites work: Duality for digital nets and its applications
cites work: Low-discrepancy sequences and global function fields with many rational places
cites work: Q4226446
cites work: Codes for the \(m\)-metric
cites work: Bounds for digital nets and sequences
cites work: Q3504258
cites work: MinT: A Database for Optimal Net Parameters
cites work: A construction of low-discrepancy sequences using global function fields
DOI: 10.1016/J.MATCOM.2007.09.010
description: scientific article; zbMATH DE number 5712929