MinT: A Database for Optimal Net Parameters

DOI10.1007/3-540-31186-6_28zbMath1130.65302OpenAlexW63651990MaRDI QIDQ5482384

Rudolf Schürer, Wolfgang Ch. Schmid

Publication date: 28 August 2006

Published in: Monte Carlo and Quasi-Monte Carlo Methods 2004 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-31186-6_28

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (19)

A direct approach to linear programming bounds for codes and tms-nets ⋮ A Global Adaptive Quasi-Monte Carlo Algorithm for Functions of Low Truncation Dimension Applied to Problems from Finance ⋮ New star discrepancy bounds for \((t,m,s)\)-nets and \((t,s)\)-sequences ⋮ Classification and nonexistence results for linear codes with prescribed minimum distances ⋮ Differential approach for the study of duals of algebraic-geometric codes on surfaces ⋮ An explicit construction of point sets with large minimum Dick weight ⋮ Some constructions of \((t,m,s)\)-nets with improved parameters ⋮ On the existence of higher order polynomial lattices based on a generalized figure of merit ⋮ Reducing a model of sugar metabolism in peach to catch different patterns among genotypes ⋮ Local antithetic sampling with scrambled nets ⋮ Skeleton simplicial evaluation codes ⋮ On the exact \(t\)-value of Niederreiter and Sobol' sequences ⋮ New explicit bounds for ordered codes and \((t,m,s)\)-nets ⋮ 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 ⋮ Cryptographic properties of cyclic binary matrices ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ Duality for digital sequences ⋮ MinT

This page was built for publication: MinT: A Database for Optimal Net Parameters