English
Related papers

Related papers: Sequences with Low Correlation

200 papers

The extent to which a sequence of finite length differs from a shifted version of itself is measured by its aperiodic autocorrelations. Of particular interest are sequences whose entries are 1 or -1, called binary sequences, and sequences…

Information Theory · Computer Science 2016-02-12 Kai-Uwe Schmidt

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…

Combinatorics · Mathematics 2024-08-27 Pierre Popoli , Manon Stipulanti

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…

Number Theory · Mathematics 2021-05-10 László Mérai , Arne Winterhof

Constructions of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic, several more general constructions of binary sequences with optimal autocorrelations and other low…

Information Theory · Computer Science 2014-11-18 Tongjiang Yan , Guang Gong

Within the Correlated Gaussian Method the parameters of the Gaussian basis functions are often chosen stochastically using pseudo-random sequences. We show that alternative low-discrepancy sequences, also known as quasi-random sequences,…

Computational Physics · Physics 2019-10-14 D. V. Fedorov

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…

Number Theory · Mathematics 2017-10-10 László Mérai , Arne Winterhof

Aperiodic autocorrelation is an important indicator of performance of sequences used in communications, remote sensing, and scientific instrumentation. Knowing a sequence's autocorrelation function, which reports the autocorrelation at…

Information Theory · Computer Science 2025-01-07 Daniel J. Katz , Adeebur Rahman , Michael J Ward

Pairs of binary sequences formed using linear combinations of multiplicative characters of finite fields are exhibited that, when compared to random sequence pairs, simultaneously achieve significantly lower mean square autocorrelation…

Information Theory · Computer Science 2017-03-28 Kelly T. R. Boothby , Daniel J. Katz

It is shown that pairs of maximal linear recursive sequences (m-sequences) typically have mean square aperiodic crosscorrelation on par with that of random sequences, but that if one takes a pair of m-sequences where one is the reverse of…

Information Theory · Computer Science 2016-07-07 Daniel J. Katz

Low correlation (finite length) sequences are used in communications and remote sensing. One seeks codebooks of sequences in which each sequence has low aperiodic autocorrelation at all nonzero shifts, and each pair of distinct sequences…

Information Theory · Computer Science 2021-12-30 Jonathan M. Castello , Daniel J. Katz , Jacob M. King , Alain Olavarrieta

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,…

Number Theory · Mathematics 2023-05-22 Arne Winterhof

Binary sequences with minimal autocorrelations have applications in communication engineering, mathematics and computer science. In statistical physics they appear as groundstates of the Bernasconi model. Finding these sequences is a…

Statistical Mechanics · Physics 2016-03-25 Tom Packebusch , Stephan Mertens

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…

Information Theory · Computer Science 2021-07-27 Zhixiong Chen , Ana I. Gómez , Domingo Gómez-Pérez , Andrew Tirkel

The primary objective of this section is to demonstrate that the actual pseudorandom measures of our construction are significantly smaller than the theoretical upper bounds derived from the Weil theorem. Regarding the family of sequences,…

Number Theory · Mathematics 2026-02-10 Katalin Gyarmati , Károly Müllner

The autocorrelation of a sequence is a useful criterion, among all, of resistance to cryptographic attacks. The behavior of the autocorrelations of random Boolean functions (studied by Florian Caullery, Eric F\'erard and Fran\c{c}ois Rodier…

Information Theory · Computer Science 2024-10-16 Florian Caullery , Eric F Érard , François Rodier

The (classical) crosscorrelation is an important measure of pseudorandomness of two binary sequences for applications in communications. The arithmetic crosscorrelation is another figure of merit introduced by Goresky and Klapper…

Cryptography and Security · Computer Science 2022-03-23 Zhixiong Chen , Zhihua Niu , Arne Winterhof

The technique of degree of randomness is used to model the correlations in sequences containing various subsignals and noise. Kolmogorov stochasticity parameter enables to quantify the randomness in number sequences and hence appears as an…

Cosmology and Nongalactic Astrophysics · Physics 2015-06-03 S. Sargsyan

Gyarmati, Mauduit and S\'ark\"ozy introduced the cross-correlation measure $\Phi_k(G)$ of order $k$ to measure the level of pseudorandom properties of families of finite binary sequences. In an earlier paper we estimated the…

Number Theory · Mathematics 2016-08-10 László Mérai

An $m$-sequence is the one of the largest period among those produced by a linear feedback shift register. It possesses several desirable features of pseudorandomness such as balance, uniform pattern distribution and ideal autocorrelation…

Information Theory · Computer Science 2022-03-23 Zhixiong Chen , Zhihua Niu , Yuqi Sang , Chenhuang Wu

Gaussian random number generators attract a widespread interest due to their applications in several fields. Important requirements include easy implementation, tail accuracy, and, finally, a flat spectrum. In this work, we study the…

Information Theory · Computer Science 2024-04-04 Francisco-Javier Soto , Ana I. Gómez , Domingo Gómez-Pérez
‹ Prev 1 2 3 10 Next ›