MinT

swMATH1446MaRDI QIDQ14185FDOQ14185

Author name not available (Why is that?)

Official website: http://mint.sbg.ac.at/

Described by source

• MinT: A Database for Optimal Net Parameters

Cited In (52)

• Reducing a model of sugar metabolism in peach to catch different patterns among genotypes
• On optimal linear codes over \(\mathbb F_5\)
• A higher order Blokh-Zyablov propagation rule for higher order nets
• Multi-point codes from the GGS curves
• New explicit bounds for ordered codes and \((t,m,s)\)-nets
• Duality theory and propagation rules for generalized digital nets
• Differential approach for the study of duals of algebraic-geometric codes on surfaces
• Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences
• Cubic and higher degree bounds for codes and \((t,m,s)\)-nets
• New constructions of entanglement-assisted quantum codes
• An explicit construction of point sets with large minimum Dick weight
• Enumeration of symmetric \((45,12,3)\) designs with nontrivial automorphisms
• From van der Corput to modern constructions of sequences for quasi-Monte Carlo rules
• On the complexity of additively homomorphic UC commitments
• Local antithetic sampling with scrambled nets
• Improved upper bounds on the star discrepancy of \((t,m,s)\)-nets and \((t,s)\)-sequences
• Cryptographic properties of cyclic binary matrices
• Duality for digital sequences
• Monte Carlo and quasi-Monte Carlo sampling
• Skeleton simplicial evaluation codes
• Improvements on the star discrepancy of \((t,s)\)-sequences
• Monte Carlo and Quasi-Monte Carlo Methods 2004
• Algebraic geometric codes on many points from Kummer extensions
• On the exact \(t\)-value of Niederreiter and Sobol' sequences
• A global adaptive quasi-Monte Carlo algorithm for functions of low truncation dimension applied to problems from finance
• Algorithm 823
• RandQMC
• MiniLEGO
• A direct approach to linear programming bounds for codes and tms-nets
• On the existence of higher order polynomial lattices based on a generalized figure of merit
• Code Tables
• TinyLEGO
• manYPoints
• A new construction of (t,s)-sequences and some improved bounds on their quality parameter
• MinT -- new features and new results
• Performance of cubature formulae in probabilistic model analysis and optimization
• Construction of rational surfaces yielding good codes
• A new class of Latin hypercube designs with high-dimensional hidden projective uniformity
• Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory
• Computing sharp recovery structures for locally recoverable codes
• Computational approach to enumerate non-hyperelliptic superspecial curves of genus 4
• The nonzero gain coefficients of Sobol's sequences are always powers of two
• Propagation rules for \((u, m, \mathbf{e}, s)\)-nets and \((u, \mathbf{e}, s)\)-sequences
• Classification and nonexistence results for linear codes with prescribed minimum distances
• Weierstrass semigroups from Kummer extensions
• Low-discrepancy sequences using duality and global function fields
• MinT-architecture and applications of the \((t, m, s)\)-net and OOA database
• Bases of Riemann-Roch spaces from Kummer extensions and algebraic geometry codes
• Some constructions of \((t,m,s)\)-nets with improved parameters
• SOAs
• Quasi-Monte Carlo methods with applications in finance
• Locally recoverable \(J\)-affine variety codes

This page was built for software: MinT