Constructions of (t, m, s)-net and (t, s)-sequences

Finite Fields and their Applications

Volumn 11, Issue 3, 2005, Pages 578-600

  Niederreiter, Harald ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Digital (t, s) sequence; Digital net; Duality theory for digital nets; Net, (t, s) sequence; Ordered orthogonal array; Polynomial lattice; Quasi Monte Carlo method; Scrambled (t, s) sequence; Scrambled net

Indexed keywords

COMBINATORIAL MATHEMATICS; LINEAR EQUATIONS; MATHEMATICAL TRANSFORMATIONS; MONTE CARLO METHODS; POLYNOMIALS; PROBABILITY; THEOREM PROVING;

DIGITAL NETS; DIGITAL SEQUENCE; DUALITY THEORY FOR DIGITAL NETS; ORDERED ORTHOGONAL ARRAY; POLYNOMIAL LATTICE; QUASI-MONTE CARLO METHOD; SCRAMBLED NET; SCRAMBLED SEQUENCE;

SET THEORY;

EID: 23044461865     PISSN: 10715797     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ffa.2005.01.001     Document Type: Article

References (80)

1. E.I. Atanassov, A new efficient algorithm for generating the scrambled Sobol' sequence, in: I. Dimov, I. Lirkov, S. Margenov, Z. Zlatev (Eds.), Numerical Methods and Applications, Lecture Notes in Computer Science, vol. 2542, Springer, Berlin, 2003, pp. 83-90.
2. J. Bierbrauer Y. Edel W.Ch. Schmid Coding-theoretic constructions for (t, m, s) -nets and ordered orthogonal arrays J. Combin. Designs 10 2002 403-418
3. A.T. Clayman K.M. Lawrence G.L. Mullen H. Niederreiter N.J.A. Sloane Updated tables of parameters of (t, m, s) -nets J. Combin. Designs 7 1999 381-393
4. C.J. Colbourn, J.H. Dinitz, D.R. Stinson, Applications of combinatorial designs to communications, cryptography, and networking, in: J.D. Lamb, D.A. Preece (Eds.), Surveys in Combinatorics 1999, London Mathematical Society, Lecture Note Series, vol. 267, Cambridge University Press, Cambridge, 1999, pp. 37-100.
5. S.B. Damelin G. Michalski G.L. Mullen D. Stone The number of linearly independent binary vectors with applications to the construction of hypercubes and orthogonal arrays, pseudo (t, m, s) -nets and linear codes Monatsh. Math. 141 2004 277-288
6. J. Dick, F.Y. Kuo, F. Pillichshammer, I.H. Sloan, Construction algorithms for polynomial lattice rules for multivariate integration, Math. Comp., to appear.
7. J. Dick, H. Niederreiter, F. Pillichshammer, Weighted star discrepancy of digital nets in prime bases, preprint, 2004.
8. 2, preprint, 2004.
9. J. Dick, F. Pillichshammer, Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces, J. Complexity, to appear.
10. Y. Edel J. Bierbrauer Families of ternary (t, m, s)-nets related to BCH-codes Monatsh. Math. 132 2001 99-103
11. H. Faure Variations on (0, s)-sequences J. Complexity 17 2001 741-753
12. H. Faure S. Tezuka Another random scrambling of digital (t, s) -sequences in K.-T. Fang F.J. Hickernell H. Niederreiter (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2000 2002 Springer Berlin 242-256
13. M.E. Flahive The quality parameter for digital (t, m, s)-nets Math. Comp. Simulation 62 2003 327-333
14. B.L. Fox Strategies for Quasi-Monte Carlo 1999 Kluwer Academic Publishers Boston
15. I. Friedel A. Keller Fast generation of randomized low-discrepancy point sets in K.-T. Fang F.J. Hickernell H. Niederreiter (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2000 2002 Springer Berlin 257-273
16. G. van der Geer, M. van der Vlugt, Tables of curves with many points, available at http://www.science.uva.nl/~geer/tables-mathcomp14.ps.
17. P. Hellekalek Digital (t, m, s)-nets and the spectral test Acta Arith. 105 2002 197-204
18. T. Helleseth T. Kløve V.I. Levenshtein Hypercubic 4- and 5-designs from double-error-correcting BCH codes Designs Codes Cryptogr. 28 2003 265-282
19. F.J. Hickernell The mean square discrepancy of randomized nets ACM Trans. Modeling Comp. Simulation 6 1996 274-296
20. F.J. Hickernell H.S. Hong The asymptotic efficiency of randomized nets for quadrature Math. Comp. 68 1999 767-791
21. F.J. Hickernell R.X. Yue The mean square discrepancy of scrambled (t, s) -sequences SIAM J. Numer. Anal. 38 2001 1089-1112
22. H.S. Hong, Digital nets and sequences for quasi-Monte Carlo methods, Ph.D. Thesis, Hong Kong Baptist University, 2002.
23. H.S. Hong F.J. Hickernell Algorithm 823: Implementing scrambled digital sequences ACM Trans. Math. Software 29 2003 95-109
24. A. Knopfmacher J.N. Ridley G.L. Mullen Nets and sequences obtained from irreducible polynomials over finite fields Applicable Algebra Eng. Comm. Comput. 9 1998 265-269
25. G. Larcher, Digital points sets: Analysis and application, in: P. Hellekalek, G. Larcher (Eds.), Random and Quasi-Random Point Sets, Lecture Notes in Statistics, vol. 138, Springer, New York, 1998, pp. 167-222.
26. K.M. Lawrence, A. Mahalanabis, G.L. Mullen, W.Ch. Schmid, Construction of digital (t, m, s)-nets from linear codes, in: S. Cohen, H. Niederreiter (Eds.), Finite Fields and Applications, London Mathematical Society, Lecture Note Series, vol. 233, Cambridge University Press, Cambridge, 1996, pp. 189-208.
27. C.F. Laywine G.L. Mullen Discrete Mathematics Using Latin Squares 1998 Wiley New York
28. C.F. Laywine G.L. Mullen A hierarchy of complete orthogonal structures Ars Combin. 63 2002 75-88
29. P. L'Ecuyer Polynomial integration lattices in H. Niederreiter (ed) Monte Carlo and Quasi-Monte Carlo Methods 2002 2004 Springer Berlin 73-98
30. P. L'Ecuyer C. Lemieux Recent advances in randomized quasi-Monte Carlo methods in M. Dror P. L'Ecuyer F. Szidarovszky (eds) Modeling Uncertainty: An Examination of Stochastic Theory, Methods, and Applications 2002 Kluwer Academic Publishers Boston 419-474
31. C. Lemieux P. L'Ecuyer Randomized polynomial lattice rules for multivariate integration and simulation SIAM J. Sci. Comput. 24 2003 1768-1789
32. W.J. Martin Linear programming bounds for ordered orthogonal arrays and (t, m, s)-nets in H. Niederreiter J. Spanier (ed) Monte Carlo and Quasi-Monte Carlo Methods 1998 2000 Springer Berlin 368-376
33. W.J. Martin D.R. Stinson A generalized Rao bound for ordered orthogonal arrays and (t, m, s)-nets Canad. Math. Bull. 42 1999 359-370
34. W.J. Martin D.R. Stinson Association schemes for ordered orthogonal arrays and (t, m, s) -nets Canad. J. Math. 51 1999 326-346
35. 2 -discrepancy for anchored boxes J. Complexity 14 1998 527-556
36. J. Matoušek Geometric Discrepancy: An Illustrated Guide 1999 Springer Berlin
37. G.L. Mullen Orthogonal hypercubes and related designs J. Statist. Planning Inference 73 1998 177-188
38. G.L. Mullen, A. Mahalanabis, H. Niederreiter, Tables of (t, m, s)-net and (t, s)-sequence parameters, in: H. Niederreiter, P.J.-S. Shiue (Eds.), Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, Lecture Notes in Statistics, vol. 106, Springer, New York, 1995, pp. 58-86.
39. H. Niederreiter Low-discrepancy point sets Monatsh. Math. 102 1986 155-167
40. H. Niederreiter Point sets and sequences with small discrepancy Monatsh. Math. 104 1987 273-337
41. H. Niederreiter Low-discrepancy and low-dispersion sequences J. Number Theory 30 1988 51-70
42. H. Niederreiter A combinatorial problem for vector spaces over finite fields Discrete Math. 96 1991 221-228
43. H. Niederreiter Low-discrepancy point sets obtained by digital constructions over finite fields Czechoslovak Math. J. 42 1992 143-166
44. H. Niederreiter Random Number Generation and Quasi-Monte Carlo Methods 1992 SIAM Philadelphia
45. H. Niederreiter Constructions of (t, m, s)-nets in H. Niederreiter J. Spanier (eds) Monte Carlo and Quasi-Monte Carlo Methods 1998 2000 Springer Berlin 70-85
46. H. Niederreiter Error bounds for quasi-Monte Carlo integration with uniform point sets J. Comput. Appl. Math. 150 2003 283-292
47. H. Niederreiter The existence of good extensible polynomial lattice rules Monatsh. Math. 139 2003 295-307
48. H. Niederreiter Some current issues in quasi-Monte Carlo methods J. Complexity 19 2003 428-433
49. H. Niederreiter High-dimensional numerical integration in J.M. Hill R. Moore (eds) Applied Mathematics Entering the 21st Century: Invited Talks from the ICIAM 2003 Congress 2004 SIAM Philadelphia 337-351
50. H. Niederreiter Digital nets and coding theory in K.Q. Feng H. Niederreiter C.P. Xing (eds) Coding, Cryptography and Combinatorics, Progress in Computer Science and Applied Logic vol. 23 2004 Birkhäuser Basel 247-257
51. H. Niederreiter F. Özbudak Constructions of digital nets using global function fields Acta Arith. 105 2002 279-302
52. H. Niederreiter F. Özbudak Matrix-product constructions of digital nets Finite Fields Appl. 10 2004 464-479
53. H. Niederreiter G. Pirsic Duality for digital nets and its applications Acta Arith. 97 2001 173-182
54. H. Niederreiter G. Pirsic The microstructure of (t, m, s)-nets J. Complexity 17 2001 683-696
55. H. Niederreiter G. Pirsic A Kronecker product construction for digital nets in K.-T. Fang F.J. Hickernell H. Niederreiter (eds) Monte Carlo and Quasi-Monte Carlo Methods 2000 2002 Springer Berlin 396-405
56. H. Niederreiter, C.P. Xing, Quasirandom points and global function fields, in: S. Cohen, H. Niederreiter (Eds.), Finite Fields and Applications, London Mathematical Society, Lecture Note Series, vol. 233, Cambridge University Press, Cambridge, 1996, pp. 269-296.
57. H. Niederreiter, C.P. Xing, Nets, (t, s)-sequences, and algebraic geometry, in: P. Hellekalek, G. Larcher (Eds.), Random and Quasi-Random Point Sets, Lecture Notes in Statistics, vol. 138, Springer, New York, 1998, pp. 267-302.
58. H. Niederreiter C.P. Xing Rational Points on Curves over Finite Fields: Theory and Applications 2001 Cambridge University Press Cambridge
59. H. Niederreiter C.P. Xing Constructions of digital nets Acta Arith. 102 2002 189-197
60. A.B. Owen, Randomly permuted (t, m, s)-nets and (t, s)-sequences, in: H. Niederreiter, P.J.-S. Shiue (Eds.), Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, Lecture Notes in Statistics, vol. 106, Springer, New York, 1995, pp. 299-317.
61. A.B. Owen Monte Carlo variance of scrambled net quadrature SIAM J. Numer. Anal. 34 1997 1884-1910
62. A.B. Owen Scrambling Sobol' and Niederreiter-Xing points J. Complexity 14 1998 466-489
63. A.B. Owen Variance with alternative scramblings of digital nets ACM Trans. Modeling Comp. Simulation 13 2003 363-378
64. 2 Finite Fields Appl. 8 2002 444-454
65. G. Pirsic Base changes for (t, m, s)-nets and related sequences Sitzungsber. Österr. Akad. Wiss. Math.-Naturw. Kl. II 208 1999 115-122
66. G. Pirsic A software implementation of Niederreiter-Xing sequences in K.-T. Fang F.J. Hickernell H. Niederreiter (eds) Monte Carlo and Quasi-Monte Carlo Methods 2000 2002 Springer Berlin 434-445
67. G. Pirsic, J. Dick, F. Pillichshammer, Cyclic digital nets, hyperplane nets and multivariate integration in Sobolev spaces, preprint, 2005.
68. G. Pirsic W.Ch. Schmid Calculation of the quality parameter of digital nets and application to their construction J. Complexity 17 2001 827-839
69. M.Yu. Rosenbloom M.A. Tsfasman Codes for the m -metric Problems Inform. Transmission 33 1997 45-52
70. W.Ch. Schmid, Shift-nets: A new class of binary digital (t, m, s)-nets, in: H. Niederreiter, P. Hellekalek, G. Larcher, P. Zinterhof (Eds.), Monte Carlo and Quasi-Monte Carlo Methods 1996, Lecture Notes in Statistics, vol. 127, Springer, New York, 1998, pp. 369-381.
71. W.Ch. Schmid The exact quality parameter of nets derived from Sobol' and Niederreiter sequences in O.P. Iliev et al. (eds) Recent Advances in Numerical Methods and Applications II 1999 World Scientific Singapore 296-304
72. W.Ch. Schmid Improvements and extensions of the "Salzburg tables"; by using irreducible polynomials in H. Niederreiter J. Spanier (eds) Monte Carlo and Quasi-Monte Carlo Methods 1998 2000 Springer Berlin 436-447
73. W.Ch. Schmid Projections of digital nets and sequences Math. Comp. Simulation 55 2001 239-247
74. R. Schürer, W.Ch. Schmid, MinT: A database for optimal net parameters, preprint, 2004.
75. M.M. Skriganov Coding theory and uniform distributions (Russian) Algebra Anal. 13 2001 191-239
76. S. Tezuka Polynomial arithmetic analogue of Hickernell sequences H. Niederreiter Monte Carlo and Quasi-Monte Carlo Methods 2002 2004 Springer Berlin 451-459
77. S. Tezuka H. Faure I -binomial scrambling of digital nets and sequences J. Complexity 19 2003 744-757
78. C.P. Xing H. Niederreiter Digital nets, duality, and algebraic curves in H. Niederreiter (ed) Monte Carlo and Quasi-Monte Carlo Methods 2002 2004 Springer Berlin 155-166
79. R.-X. Yue F.J. Hickernell The discrepancy and gain coefficients of scrambled digital nets J. Complexity 18 2002 135-151
80. W.-L. Loh On the asymptotic distribution of scrambled net quadrature Ann. Statist. 31 2003 1282-1324