Displaying similar documents to “Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences”

A generalization of NUT digital (0,1)-sequences and best possible lower bounds for star discrepancy

Henri Faure, Friedrich Pillichshammer (2013)

Acta Arithmetica

Similarity:

In uniform distribution theory, discrepancy is a quantitative measure for the irregularity of distribution of a sequence modulo one. At the moment the concept of digital (t,s)-sequences as introduced by Niederreiter provides the most powerful constructions of s-dimensional sequences with low discrepancy. In one dimension, recently Faure proved exact formulas for different notions of discrepancy for the subclass of NUT digital (0,1)-sequences. It is the aim of this paper to generalize...

Irreducible Sobol' sequences in prime power bases

Henri Faure, Christiane Lemieux (2016)

Acta Arithmetica

Similarity:

Sobol' sequences are a popular family of low-discrepancy sequences, in spite of requiring primitive polynomials instead of irreducible ones in later constructions by Niederreiter and Tezuka. We introduce a generalization of Sobol' sequences that removes this shortcoming and that we believe has the potential of becoming useful for practical applications. Indeed, these sequences preserve two important properties of the original construction proposed by Sobol': their generating matrices...

On the correlation of families of pseudorandom sequences of k symbols

Kit-Ho Mak, Alexandru Zaharescu (2016)

Acta Arithmetica

Similarity:

In an earlier paper Gyarmati introduced the notion of f-correlation for families of binary pseudorandom sequences as a measure of randomness in the family. In this paper we generalize the f-correlation to families of pseudorandom sequences of k symbols and study its properties.