Skip to main content
SpringerLink
Log in

Construction of digital nets from BCH-codes

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

Part of the book series: Lecture Notes in Statistics ((LNS,volume 127))

Abstract

We establish a link between the theory of error-correcting codes and the theory of (t, m, s)-nets. This leads to the fundamental problem of net embeddings of linear codes. Our main result is the construction of four infinite families of digital (t, m, s)-nets based on BCH- codes.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. M. J. Adams and B. L. Shader, A construction for (t,m, s)-nets in base q, SIAM Journal of Discrete Mathematics, to appear.

    Google Scholar 

  2. A. T. Clayman, K. M. Lawrence, G. L. Mullen, H. Niederreiter, and N. J. A. Sloane, Updated tables of parameters of (t,m, s)-nets, manuscript.

    Google Scholar 

  3. G. Larcher, H. Niederreiter, and W.C.H. Schmid, Digital nets and sequences constructed over finite rings and their application to quasi-Monte Carlo integration, Monatshefte Mathematik 121 (1996), 231–253.

    Article  MathSciNet  Google Scholar 

  4. K. M. Lawrence, A. Mahalanabis, G. L. Mullen, and W.C.H. Schmid, Construction of digital (t,m, s) -nets from linear codes, in S. Cohen and H. Niederreiter, editors, Finite Fields and Applications (Glasgow, 1995), volume 233 of Lecture Notes Series of the London Mathematical Society, pages 189–208. Cambridge University Press, Cambridge, 1996.

    Chapter  Google Scholar 

  5. K. M. Lawrence, A combinatorial characterization of (t, m,s)-nets in base b, J. Comb. Designs 4 (1996),275–293.

    Article  MathSciNet  Google Scholar 

  6. G. L. Mullen and W. C.H. SchmidAn equivalence between (t, m, s)-nets and strongly orthogonal hypercubes, Journal of Combinatorial Theory A 76 (1996), 164–174.

    Article  MathSciNet  Google Scholar 

  7. H. Niederreiter, Point sets and sequences with small discrepancy, Monatshefte Mathematik 104 (1987),273–337.

    Article  MathSciNet  Google Scholar 

  8. H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, Number 63 in CBMS-NSF Series in Applied Mathematics. SIAM, Philadelphia, 1992.

    Book  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut der Universität, Im Neuenheimer Feld 288, Heidelberg, 69120, Germany

    Yves Edel

  2. Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan, 49931, USA

    Jürgen Bierbrauer

Authors
  1. Yves Edel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jürgen Bierbrauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Processing, Austrian Academy of Sciences, Vienna, A-1010, Austria

    Harald Niederreiter

  2. Department of Mathematics, University of Salzburg, Salzburg, A-5020, Austria

    Peter Hellekalek , Gerhard Larcher  & Peter Zinterhof ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media New York

About this paper

Cite this paper

Edel, Y., Bierbrauer, J. (1998). Construction of digital nets from BCH-codes. In: Niederreiter, H., Hellekalek, P., Larcher, G., Zinterhof, P. (eds) Monte Carlo and Quasi-Monte Carlo Methods 1996. Lecture Notes in Statistics, vol 127. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1690-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-1690-2_13

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-98335-6

  • Online ISBN: 978-1-4612-1690-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation