Low-Discrepancy Sequences and Global Function Fields with Many Rational Places

Authors:
Harold Niederreiter;Chaoping Xing
Affiliations:
Institut für Informationsverarbeitung, Österreichische Akademie der Wissenschaften, Sonnenfelsgasse 19, A-1010, Vienna, Austriaf1E-mail: nied@qiinfo.oeaw.ac.atf1;Department of Mathematics, University of Science and Technology of China, Hefei, Anhui, 230026, People's Republic of China
Venue:
Finite Fields and Their Applications
Year:
1996

Citing 6
Cited 19

A combinatorial problem for vector spaces over finite fields

Discrete Mathematics
Random number generation and quasi-Monte Carlo methods

Random number generation and quasi-Monte Carlo methods
Implementation and tests of low-discrepancy sequences

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Polynomial arithmetic analogue of Halton sequences

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Quasi-random methods for estimating integrals using relatively small samples

SIAM Review
Algebraic-Geometric Codes

Algebraic-Geometric Codes

Latin supercube sampling for very high-dimensional simulations

ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
A constructive approach to strong tractability using Quasi-Monte Carlo algorithms

Journal of Complexity
Curves with Many Points and Their Applications

AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Discrepancy Theory and Its Application to Finance

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Strong tractability of multivariate integration using quasi-Monte Carlo algorithms

Mathematics of Computation
Asymptotically optimal declustering schemes for 2-dim range queries

Theoretical Computer Science - Database theory
Riemann-Roch spaces of the Hermitian function field with applications to algebraic geometry codes and low-discrepancy sequences

Journal of Pure And Applied Algebra
On linear codes with large weights simultaneously for the Rosenbloom--Tsfasman and Hamming metrics

Journal of Complexity
Low discrepancy sequences in high dimensions: How well are their projections distributed?

Journal of Computational and Applied Mathematics
On the exact t-value of Niederreiter and Sobol' sequences

Journal of Complexity
On efficient Monte Carlo-based statistical static timing analysis of digital circuits

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Duality for digital sequences

Journal of Complexity
MinT-Architecture and applications of the (t, m, s)-net and OOA database

Mathematics and Computers in Simulation
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding

Journal of Complexity
Advanced variance reduction and sampling techniques for efficient statistical timing analysis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
The torsion-limit for algebraic function fields and its application to arithmetic secret sharing

CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Computational investigation of low-discrepancy sequences in simulation algorithms for Bayesian networks

UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method

Journal of Complexity
Randomized Halton sequences

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We construct digital (t,s)-sequences in a prime-power baseqfor which the quality parameterthas the least possible order of magnitude. The construction uses algebraic function fields over the finite field of orderqwhich contain many places of degree 1 relative to the genus.