论文标题
具有高功绩因子的长偏度对称二进制序列的计算搜索
Computational Searching of Long Skew-symmetric Binary Sequences with High Merit Factors
论文作者
论文摘要
在本文中，我们介绍了具有奇数长度的较长二进制序列的最著名优点因子的计算搜索。找到具有最佳或次级优点因素的低自相关二进制序列是一个非常困难的优化问题。提出并解决了启发式算法的改进版本，以搜索具有良好自相关属性的上的二进制序列。通过执行我们的随机算法来搜索具有高功绩因子的偏斜对称二进制序列的高性能计算。在实验工作之后，作为结果，我们提出了新的二进制序列，其偏斜偏度的201到303之间的奇数长度且具有优点因子$ f $大于8.5。此外，在201至303之间的所有奇数长度上都发现了一个具有$ f> 8 $的二进制序列的示例。迄今为止最长的二进制序列是迄今为止发现的$ f> 9 $的长度为255。
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.
