Skip to main content

A Kronecker Product Construction for Digital Nets

  • Conference paper
Monte Carlo and Quasi-Monte Carlo Methods 2000

Abstract

An analogy of (t,m, s)-nets with codes, viz. the notion of the dual space of a digital net, is used to obtain a new way of constructing digital nets. The method is reminiscent of the Kronecker product code construction in the theory of linear codes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams M.J., Shader B.L. (1997) A construction for (t,m, s)-nets in base q. SIAM J. Discrete Math. 10:460–468

    Article  MathSciNet  MATH  Google Scholar 

  2. Edel Y., Bierbrauer J. (1998) Construction of digital nets from BCH-codes. In: Niederreiter H. et al. (Eds.) Monte Carlo and Quasi-Monte Carlo Methods 1996, Lecture Notes in Statistics 127. Springer, New York, 221–231

    Chapter  Google Scholar 

  3. Lawrence K.M., Mahalanabis A., Mullen G.L., Schmid W.Ch. (1996) Construction of digital (t,m, s)-nets from linear codes. In: Cohen S., Niederreiter H. (Eds.) Finite Fields and Applications, London Math. Soc. Lecture Note Series 233. Cambridge Univ. Press, Cambridge, 189–208

    Chapter  Google Scholar 

  4. MacWilliams F.J., Sloane N.J.A. (1977) The Theory of Error-Correcting Codes. North-Holland, Amsterdam

    MATH  Google Scholar 

  5. Niederreiter H. (1987) Point sets and sequences with small discrepancy. Monatsh. Math. 104:273–337

    Article  MathSciNet  MATH  Google Scholar 

  6. Niederreiter H. (1991) A combinatorial problem for vector spaces over finite fields. Discrete Math. 96:221–228

    Article  MathSciNet  MATH  Google Scholar 

  7. Niederreiter H. (1992) Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia

    Book  MATH  Google Scholar 

  8. Niederreiter H. (2000) Constructions of (t,m, s)-nets. In: Niederreiter H., Spanier J. (Eds.) Monte Carlo and Quasi-Monte Carlo Methods 1998. Springer, Berlin, 70–85

    Google Scholar 

  9. Niederreiter H., Pirsic G. (2001) Duality for digital nets and its applications. Acta Arith. 97:173–182

    Article  MathSciNet  MATH  Google Scholar 

  10. Niederreiter H., Xing C.P. (1998) Nets, (t,s)-sequences, and algebraic geometry. In: Hellekalek P., Larcher G. (Eds.) Random and Quasi-Random Point Sets, Lecture Notes in Statistics 138. Springer, New York, 267–302

    Chapter  Google Scholar 

  11. Niederreiter H., Xing C.P. (2001) Rational Points on Curves over Finite Fields: Theory and Applications. Cambridge Univ. Press, Cambridge

    MATH  Google Scholar 

  12. Niederreiter H., Xing C.P. (2001) Constructions of digital nets. Acta Arith., to appear

    Google Scholar 

  13. Schmid W.Ch., Wolf R. (1997) Bounds for digital nets and sequences. Acta Arith. 78:377–399

    MathSciNet  MATH  Google Scholar 

  14. Skriganov M.M. (1999) Coding theory and uniform distributions. Preprint, Steklov Math. Institute, St. Petersburg

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Niederreiter, H., Pirsic, G. (2002). A Kronecker Product Construction for Digital Nets. In: Fang, KT., Niederreiter, H., Hickernell, F.J. (eds) Monte Carlo and Quasi-Monte Carlo Methods 2000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56046-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-56046-0_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42718-6

  • Online ISBN: 978-3-642-56046-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics