Computational Searching of Long Skew-symmetric Binary Sequences with High Merit Factors

Abstract

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 optimization problem. An improved version of the heuristic algorithm is presented and tackled to search for aperiodic binary sequences with good autocorrelation properties. High-performance computations with the execution of our stochastic algorithm to search skew-symmetric binary sequences with high merit factors. After experimental work, as results, we present new binary sequences with odd lengths between 201 and 303 that are skew-symmetric and have the merit factor $F$ greater than 8.5. Moreover, an example of a binary sequence having $F>8$ has been found for all odd lengths between 201 and 303. The longest binary sequence with $F>9$ found to date is of length 255.

8 pages, 2 figures, 1 algorithm, 1 table

References in corpus (2)

• On the Skew-Symmetric Binary Sequences and the Merit Factor Problem
• On maximal autocorrelations of Rudin-Shapiro sequences

Cited by in corpus (2)

• Parallel Self-Avoiding Walks for a Low-Autocorrelation Binary Sequences Problem
• Dual-Step Optimization for Binary Sequences with High Merit Factors