TY - JOUR
AU - Janez Brest
AU - Borko Bošković
PY - 2022/12/20
Y2 - 2024/05/21
TI - Computational Search of Long Skew-symmetric Binary Sequences with High Merit Factors
JF - MENDEL
JA - mendel
VL - 28
IS - 2
SE - Research articles
DO - 10.13164/mendel.2022.2.017
UR - https://www.mendel-journal.org/index.php/mendel/article/view/189
AB - 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 algorithmto 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.
ER -