English
Related papers

Related papers: The mean and variance of the reciprocal merit fact…

200 papers

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

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

A method for estimating the merit factors of sequences will be provided. The result is also effective in determining the nonexistence of certain infinite collections of cyclic difference sets and cyclic matrices and associated binary…

Number Theory · Mathematics 2013-07-11 N. A. Carella

We calculate the asymptotic merit factor, under all cyclic rotations of rows and columns, of two families of binary two-dimensional arrays derived from the quadratic character. The arrays in these families have size p x q, where p and q are…

Information Theory · Computer Science 2015-03-19 Kai-Uwe Schmidt

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

It has been noticed that all the known binary sequences having the asymptotic merit factor $\ge 6$ are the modifications to the real primitive characters. In this paper, we give a new modification of the character sequences at length…

Information Theory · Computer Science 2014-07-14 Tingyao Xiong , Jonathan I. Hall

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

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

Borwein and Mossinghoff investigated the Rudin-Shapiro-like sequences, which are infinite families of binary sequences, usually represented as polynomials. Each family of Rudin-Shapiro-like sequences is obtained from a starting sequence…

Information Theory · Computer Science 2020-07-16 Daniel J. Katz , Sangman Lee , Stanislav A. Trunov

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

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

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 Ces\`aro limit - the asymptotic average of a sequence of real numbers - is an operator of fundamental importance in probability, statistics and mathematical analysis. To better understand sequences with Ces\`aro limits, this paper…

Functional Analysis · Mathematics 2022-02-22 Jonathan M. Keith , Greg Markowsky

We define a new class of ternary sequences that are 2-balanced. These sequences are obtained by colouring of Sturmian sequences. We show that the class contains sequences of any given letter frequencies. We provide an upper bound on factor…

Combinatorics · Mathematics 2024-03-20 Lubomíra Dvořáková , Zuzana Masáková , Edita Pelantová

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 detection of very similar patterns in a time series, commonly called motifs, has received continuous and increasing attention from diverse scientific communities. In particular, recent approaches for discovering similar motifs of…

Machine Learning · Computer Science 2016-05-18 Joan Serrà , Isabel Serra , Álvaro Corral , Josep Lluis Arcos

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

The asymptotic critical exponent measures for a sequence the maximum repetition rate of factors of growing length. The infimum of asymptotic critical exponents of sequences of a certain class is called the asymptotic repetition threshold of…

Combinatorics · Mathematics 2024-09-12 Lubomíra Dvořáková , Karel Klouda , Edita Pelantová
‹ Prev 1 2 3 10 Next ›