English
Related papers

Related papers: Limiting Moments of Autocorrelation Demerit Factor…

200 papers

Sequences with low aperiodic autocorrelation are used in communications and remote sensing for synchronization and ranging. The autocorrelation demerit factor of a sequence is the sum of the squared magnitudes of its autocorrelation values…

Information Theory · Computer Science 2024-08-19 Daniel J. Katz , Miriam E. Ramirez

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

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

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

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

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

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

We investigate the limiting behavior of sample central moments, examining the special cases where the limiting (as the sample size tends to infinity) distribution is degenerate. Parent (non-degenerate) distributions with this property are…

Statistics Theory · Mathematics 2018-06-07 Georgios Afendras , Nickos Papadatos , Violetta Piperigou

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

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

In this paper we study almost $p$-ary sequences and their autocorrelation coefficients. We first study the number $\ell$ of distinct out-of-phase autocorrelation coefficients for an almost $p$-ary sequence of period $n+s$ with $s$…

Combinatorics · Mathematics 2018-12-24 Büşra Özden , Oğuz Yayla

We study the distributed detection problem in the context of a balanced binary relay tree, where the leaves of the tree correspond to $N$ identical and independent sensors generating binary messages. The root of the tree is a fusion center…

Information Theory · Computer Science 2015-06-05 Zhenliang Zhang , Edwin K. P. Chong , Ali Pezeshki , William Moran , Stephen D. Howard

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

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ć

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

We consider sequences of $U$-processes based on symmetric kernels of a fixed order, that possibly depend on the sample size. Our main contribution is the derivation of a set of analytic sufficient conditions, under which the aforementioned…

Probability · Mathematics 2022-03-16 Christian Döbler , Mikołaj Kasprzak , Giovanni Peccati

In this correspondence, for every periodic $p-$ary sequence satisfying ideal two-level autocorrelation property the existence of an element of the field ${\bf GF}(p)$ which appears one time less than all the rest that are equally…

Information Theory · Computer Science 2011-03-21 Yuri L. Borissov

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

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 ›