MinT

From MaRDI portal
Software:14185



swMATH1446MaRDI QIDQ14185


No author found.





Related Items (45)

Bases of Riemann-Roch spaces from Kummer extensions and algebraic geometry codesImprovements on the star discrepancy of (t,s)-sequencesNew constructions of entanglement-assisted quantum codesA new construction of (t,s)-sequences and some improved bounds on their quality parameterAlgebraic geometric codes on many points from Kummer extensionsA direct approach to linear programming bounds for codes and tms-netsWeierstrass semigroups from Kummer extensionsA Global Adaptive Quasi-Monte Carlo Algorithm for Functions of Low Truncation Dimension Applied to Problems from FinanceMulti-point codes from the GGS curvesUnnamed ItemFrom van der Corput to modern constructions of sequences for quasi-Monte Carlo rulesThe nonzero gain coefficients of Sobol's sequences are always powers of twoA new class of Latin hypercube designs with high-dimensional hidden projective uniformityClassification and nonexistence results for linear codes with prescribed minimum distancesConstruction of rational surfaces yielding good codesDifferential approach for the study of duals of algebraic-geometric codes on surfacesAn explicit construction of point sets with large minimum Dick weightPerformance of cubature formulae in probabilistic model analysis and optimizationSome constructions of \((t,m,s)\)-nets with improved parametersMulti-wise and constrained fully weighted Davenport constants and interactions with coding theoryOn the existence of higher order polynomial lattices based on a generalized figure of meritReducing a model of sugar metabolism in peach to catch different patterns among genotypesLocally recoverable \(J\)-affine variety codesLocal antithetic sampling with scrambled netsSkeleton simplicial evaluation codesOn the exact \(t\)-value of Niederreiter and Sobol' sequencesA higher order Blokh-Zyablov propagation rule for higher order netsQuasi-Monte Carlo methods with applications in financeNew explicit bounds for ordered codes and \((t,m,s)\)-netsCubic and higher degree bounds for codes and \((t,m,s)\)-netsLow-discrepancy sequences using duality and global function fieldsDuality theory and propagation rules for generalized digital netsMinT-architecture and applications of the \((t, m, s)\)-net and OOA databaseImproved upper bounds on the star discrepancy of \((t,m,s)\)-nets and \((t,s)\)-sequencesCryptographic properties of cyclic binary matricesOn the Complexity of Additively Homomorphic UC CommitmentsDuality for digital sequencesMonte Carlo and quasi-Monte Carlo samplingMonte Carlo and Quasi-Monte Carlo Methods 2004On optimal linear codes over \(\mathbb F_5\)MINT – New Features and New ResultsComputing sharp recovery structures for locally recoverable codesConstructions of \((t,m,s)\)-nets and \((t,s)\)-sequencesComputational approach to enumerate non-hyperelliptic superspecial curves of genus 4Propagation rules for \((u, m, \mathbf{e}, s)\)-nets and \((u, \mathbf{e}, s)\)-sequences


This page was built for software: MinT