English
Related papers

Related papers: Moments of Autocorrelation Demerit Factors of Bina…

200 papers

Various problems in engineering and natural science demand binary sequences that do not resemble translates of themselves, that is, the sequences must have small aperiodic autocorrelation at every nonzero shift. If $f$ is a sequence, then…

Information Theory · Computer Science 2024-10-22 Daniel J. Katz , Miriam E. Ramirez

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

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

The merit factor of a $\{-1, 1\}$ binary sequence measures the collective smallness of its non-trivial aperiodic autocorrelations. Binary sequences with large merit factor are important in digital communications because they allow the…

Number Theory · Mathematics 2024-03-19 Jonathan Jedwab

Pursley and Sarwate established a lower bound on a combined measure of autocorrelation and crosscorrelation for a pair $(f,g)$ of binary sequences (i.e., sequences with terms in $\{-1,1\}$). If $f$ is a nonzero sequence, then its…

Information Theory · Computer Science 2022-03-08 Daniel J. Katz , Eli Moore

The identification of binary sequences with large merit factor (small mean-squared aperiodic autocorrelation) is an old problem of complex analysis and combinatorial optimization, with practical importance in digital communications…

Combinatorics · Mathematics 2013-06-19 Jonathan Jedwab , Daniel J. Katz , Kai-Uwe Schmidt

In this paper, we present a computational search for best-known merit factors of longer binary sequences with an odd length. Finding low autocorrelation binary sequences with optimal or suboptimal merit factors is a very difficult…

Information Theory · Computer Science 2023-01-13 Janez Brest , Borko Bošković

Binary $m$-sequences are ones with the largest period $n=2^m-1$ among the binary sequences produced by linear shift registers with length $m$. They have a wide range of applications in communication since they have several desirable…

Information Theory · Computer Science 2022-12-01 Xiaoyan Jing , Aixian Zhang , Keqin Feng

The merit factor problem is of practical importance to manifold domains, such as digital communications engineering, radars, system modulation, system testing, information theory, physics, chemistry. However, the merit factor problem is…

Information Theory · Computer Science 2021-06-08 Miroslav Dimitrov

Low autocorrelation binary sequences (LABS) are very important for communication applications. And it is a notoriously difficult computational problem to find binary sequences with low aperiodic autocorrelations. The problem can also be…

Information Theory · Computer Science 2015-03-18 A. Ukil

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

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

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

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…

Probability · Mathematics 2015-02-04 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

The Pursley-Sarwate criterion of a pair of finite complex-valued sequences measures the collective smallness of the aperiodic autocorrelations and the aperiodic crosscorrelations of the two sequences. It is known that this quantity is…

Information Theory · Computer Science 2019-05-30 Christian Günther , Kai-Uwe Schmidt

We discuss various tests of the factorization hypothesis making use of the close relationship between semi-leptonic and factorized nonleptonic decay amplitudes. It is pointed out that factorization leads to truely model-independent…

High Energy Physics - Phenomenology · Physics 2009-10-22 Volker Rieckert

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

Pseudorandom sequences are used extensively in communications and remote sensing. Correlation provides one measure of pseudorandomness, and low correlation is an important factor determining the performance of digital sequences in…

Information Theory · Computer Science 2018-06-14 Daniel J. Katz

In this paper, we derive a central limit theorem for collections of weakly correlated random variables indexed by discrete metric spaces, where the correlation decays in the distance of the indices. The correlation structure we study…

Probability · Mathematics 2022-02-11 Michael Fleermann , Werner Kirsch
‹ Prev 1 2 3 10 Next ›