Related papers: Low-Autocorrelation Binary Sequences: On Improved …
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…
The problem of finding aperiodic low auto-correlation binary sequences (LABS) presents a significant computational challenge, particularly as the sequence length increases. Such sequences have important applications in communication…
A low-autocorrelation binary sequences problem with a high figure of merit factor represents a formidable computational challenge. An efficient parallel computing algorithm is required to reach the new best-known solutions for this problem.…
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…
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…
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…
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…
The search for binary sequences with low peak sidelobe level value represents a formidable computational problem. To locate better sequences for this problem, we designed a stochastic algorithm that uses two fitness functions. In these…
The Low Autocorrelation Binary Sequence problem has applications in telecommunications, is of theoretical interest to physicists, and has inspired many optimisation researchers. Metaheuristics for the problem have progressed greatly in…
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…
In this work, a classical problem of the digital sequence design, or more precisely, finding binary sequences with optimal peak sidelobe level (PSL), is revisited. By combining some of our previous works, together with some mathematical…
Low Autocorrelation Binary Sequences (LABS) is a particularly challenging binary optimization problem which quickly becomes intractable in finding the global optimum for problem sizes beyond 66. This aspect makes LABS appealing to use as a…
In this paper, we design low correlation binary sequences favorable in wireless communication and radar applications. First, we formulate the designing problem as a nonconvex combination optimization problem with flexible correlation…
Binary sequences with low autocorrelations are important in communication engineering and in statistical mechanics as groundstates of the Bernasconi-model. Computer searches are the main tool to construct such sequences. Due to the…
Simple and efficient algorithm based on heuristic search by shotgun hill climbing to construct binary sequences with small peak sidelobe levels (PSL) is suggested. The algorithm is applied for generation of binary sequences of lengths…
The search of binary sequences with low auto-correlations (LABS) is a discrete combinatorial optimization problem contained in the NP-hard computational complexity class. We study this problem using Warning Propagation (WP) , a message…
We study a Bayesian binary sequential hypothesis testing problem with multiple large language models (LLMs). Each LLM $j$ has per-query cost $c_j>0$, random waiting time with mean $\mu_j>0$ and sub-Gaussian tails, and \emph{asymmetric}…
LSB (Least Significant Bit) sequences are widely used as the initial inputs in some modern stream ciphers, such as the ZUC algorithm-the core of the 3GPP LTE International Encryption Standard. Therefore, analyzing the statistical properties…
We provide a randomized linear time approximation scheme for a generic problem about clustering of binary vectors subject to additional constrains. The new constrained clustering problem encompasses a number of problems and by solving it,…
Unimodular sequences with low autocorrelations are desired in many applications, especially in the area of radar and code-division multiple access (CDMA). In this paper, we propose a new algorithm to design unimodular sequences with low…