Nets, (t, s)-Sequences, and Codes

Harald Niederreiter ()
Additional contact information
Harald Niederreiter: National University of Singapore, Department of Mathematics

A chapter in Monte Carlo and Quasi-Monte Carlo Methods 2006, 2008, pp 83-100 from Springer

Abstract: Summary Nets and (t, s)-sequences are standard sources of quasirandom points for quasi-Monte Carlo methods. Connections between nets and error-correcting codes have been noticed for a long time, and these links have become even more pronounced with the development of the duality theory for digital nets. In this paper, we further explore these fascinating connections. We present also a recent construction of digital (t, s)-sequences using global function fields and new general constructions of nets and (t, s)-sequences.

Keywords: Duality Theory; Linear Code; Global Function; Cyclic Code; Orthogonal System (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-74496-2_5

Ordering information: This item can be ordered from
http://www.springer.com/9783540744962

DOI: 10.1007/978-3-540-74496-2_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().