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