相关论文: Correlation of the Rudin-Shapiro sequence along pr…

Correlation measure of order $k$ is an important measure of randomness in binary sequences. This measure tries to look for dependence between several shifted version of a sequence. We study the relation between the correlation measure of…

In 2009, Grant, Shallit, and Stoll constructed a large family of pseudorandom sequences, called generalized Rudin--Shapiro sequences, for which they established some results about the average of discrete correlation coefficients of order 2…

Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro sequence, have some desirable features of pseudorandomness such as a large linear complexity and a small well-distribution measure. However, they also have some…

It is known that Hall's sextic residue sequence has some desirable features of pseudorandomness: an ideal two-level autocorrelation and linear complexity of the order of magnitude of its period $p$. Here we study its correlation measure of…

We introduce a family of block-additive automatic sequences, that are obtained by allocating a weight to each couple of digits, and defining the $n$th term of the sequence as being the total weight of the integer $n$ written in base $k$.…

The correlation measure is a testimony of the pseudorandomness of a sequence $\infw{s}$ and provides information about the independence of some parts of $\infw{s}$ and their shifts. Combined with the well-distribution measure, a sequence…

Motivated by the known autocorrelation properties of the Rudin-Shapiro sequence, we study the discrete correlation among infinite sequences over a finite alphabet, where we just take into account whether two symbols are identical. We show…

We consider a numeration system in the ring of integers ${\mathcal O}_K$ of a number field, which we assume to be principal. We prove that the property of being a prime in ${\mathcal O}_K$ is decorrelated from two fundamental examples of…

We study the pseudorandomness of automatic sequences in terms of well-distribution and correlation measure of order 2. We detect non-random behavior which can be derived either from the functional equations satisfied by their generating…

Three measures of pseudorandomness of finite binary sequences were introduced by Mauduit and S\'ark\"ozy in 1997 and have been studied extensively since then: the normality measure, the well-distribution measure, and the correlation measure…

The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…

Expansion complexity and maximum order complexity are both finer measures of pseudorandomness than the linear complexity which is the most prominent quality measure for cryptographic sequences. The expected value of the $N$th maximum order…

We show that any sequence $(x_n)_{n \in \mathbb{N}} \subseteq [0,1]$ that has Poissonian correlations of $k$-th order is uniformly distributed, also providing a quantitative description of this phenomenon. Additionally, we extend…

Fermat-Euler quotients arose from the study of the first case of Fermat's Last Theorem, and have numerous applications in number theory. Recently they were studied from the cryptographic aspects by constructing many pseudorandom binary…

In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity,…

In this paper, we present an alternative proof showing that the maximal aperiodic autocorrelation of the $m$-th Rudin-Shapiro sequence is of the same order as $\lambda^{m}$, where $\lambda$ is the real root of $x^{3} + x^{2} - 2x - 4$. This…

In this paper, we generalize Mauduit and Rivat's theorem on the Rudin-Shapiro sequence. Weakening the hypothesis needed in their theorem, we prove a prime number theorem for a large class of functions defined on the digits. Our result…

For N=1,2,..., let S_N be a simple random sample of size n=n_N from a population A_N of size N, where 0<=n<=N. Then with f_N=n/N, the sampling fraction, and 1_A the inclusion indicator that A is in S_N, for any H a subset of A_N of size k>=…

We prove that digital sequences modulo $m$ along squares are normal, which covers some prominent sequences like the sum of digits in base $q$ modulo $m$, the Rudin-Shapiro sequence and some generalizations. This gives, for any base, a class…

Quite recently, in [8] the authoor of this paper considered the distribution of primes in the sequence $(S_n)$ whose $n$th term is defined as $S_n=\sum_{k=1}^{2n}p_k$, where $p_k$ is the $k$th prime. Some heuristic arguments and the…