Distribution of Digital Explicit Inversive Pseudorandom Numbers and Their Binary Threshold Sequence

Zhixiong Chen (), Domingo Gomez () and Arne Winterhof ()
Additional contact information
Zhixiong Chen: Putian University, Key Laboratory of Applied Mathematics

A chapter in Monte Carlo and Quasi-Monte Carlo Methods 2008, 2009, pp 249-258 from Springer

Abstract: Abstract We study the distribution of s-dimensional points of digital explicit inversive pseudorandom numbers with arbitrary lags. We prove a discrepancy bound and derive results on the pseudorandomness of the binary threshold sequence derived from digital explicit inversive pseudorandom numbers in terms of bounds on the correlation measure of order k and the linear complexity profile. The proofs are based on bounds on exponential sums and earlier relations of Mauduit, Niederreiter and Sárközy between discrepancy and correlation measure of order k and of Brandstätter and the third author between correlation measure of order k and linear complexity profile, respectively.

Keywords: Binary Sequence; Linear Complexity; Correlation Measure; Pseudorandom Number; Pseudorandom Sequence (search for similar items in EconPapers)
Date: 2009
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-642-04107-5_14

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

DOI: 10.1007/978-3-642-04107-5_14

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 ().