The following pages link to MinT (Q14185):
Displaying 45 items.
- Differential approach for the study of duals of algebraic-geometric codes on surfaces (Q449692) (← links)
- Performance of cubature formulae in probabilistic model analysis and optimization (Q484853) (← links)
- Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory (Q491979) (← links)
- Cubic and higher degree bounds for codes and \((t,m,s)\)-nets (Q543422) (← links)
- Construction of rational surfaces yielding good codes (Q640004) (← links)
- A higher order Blokh-Zyablov propagation rule for higher order nets (Q690427) (← links)
- Duality for digital sequences (Q731970) (← links)
- Computing sharp recovery structures for locally recoverable codes (Q782862) (← links)
- Computational approach to enumerate non-hyperelliptic superspecial curves of genus 4 (Q784843) (← links)
- From van der Corput to modern constructions of sequences for quasi-Monte Carlo rules (Q898073) (← links)
- Some constructions of \((t,m,s)\)-nets with improved parameters (Q938764) (← links)
- Local antithetic sampling with scrambled nets (Q955143) (← links)
- On the exact \(t\)-value of Niederreiter and Sobol' sequences (Q958245) (← links)
- Quasi-Monte Carlo methods with applications in finance (Q964676) (← links)
- New explicit bounds for ordered codes and \((t,m,s)\)-nets (Q965983) (← links)
- MinT-architecture and applications of the \((t, m, s)\)-net and OOA database (Q974248) (← links)
- On optimal linear codes over \(\mathbb F_5\) (Q1024432) (← links)
- Algebraic geometric codes on many points from Kummer extensions (Q1637205) (← links)
- A new class of Latin hypercube designs with high-dimensional hidden projective uniformity (Q1946947) (← links)
- Reducing a model of sugar metabolism in peach to catch different patterns among genotypes (Q1985981) (← links)
- Locally recoverable \(J\)-affine variety codes (Q1987102) (← links)
- Cryptographic properties of cyclic binary matrices (Q2025370) (← links)
- Bases of Riemann-Roch spaces from Kummer extensions and algebraic geometry codes (Q2123312) (← links)
- New constructions of entanglement-assisted quantum codes (Q2130024) (← links)
- Multi-point codes from the GGS curves (Q2176293) (← links)
- Skeleton simplicial evaluation codes (Q2249790) (← links)
- Propagation rules for \((u, m, \mathbf{e}, s)\)-nets and \((u, \mathbf{e}, s)\)-sequences (Q2347962) (← links)
- A direct approach to linear programming bounds for codes and tms-nets (Q2383988) (← links)
- Weierstrass semigroups from Kummer extensions (Q2396761) (← links)
- Classification and nonexistence results for linear codes with prescribed minimum distances (Q2436576) (← links)
- An explicit construction of point sets with large minimum Dick weight (Q2442865) (← links)
- On the existence of higher order polynomial lattices based on a generalized figure of merit (Q2465289) (← links)
- Improved upper bounds on the star discrepancy of \((t,m,s)\)-nets and \((t,s)\)-sequences (Q2496178) (← links)
- Monte Carlo and quasi-Monte Carlo sampling (Q2518249) (← links)
- Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences (Q2566178) (← links)
- The nonzero gain coefficients of Sobol's sequences are always powers of two (Q2685064) (← links)
- On the Complexity of Additively Homomorphic UC Commitments (Q2796142) (← links)
- Improvements on the star discrepancy of \((t,s)\)-sequences (Q2889255) (← links)
- Monte Carlo and Quasi-Monte Carlo Methods 2004 (Q3376486) (← links)
- MINT – New Features and New Results (Q3405432) (← links)
- Duality theory and propagation rules for generalized digital nets (Q3584815) (← links)
- (Q5241122) (← links)
- A new construction of (t,s)-sequences and some improved bounds on their quality parameter (Q5293291) (← links)
- A Global Adaptive Quasi-Monte Carlo Algorithm for Functions of Low Truncation Dimension Applied to Problems from Finance (Q5326133) (← links)
- Low-discrepancy sequences using duality and global function fields (Q5423578) (← links)
