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.
翻译:在本文中, 我们提出一个最出名的优点因素的计算搜索, 包括较长的二进制序列。 找到具有最佳或亚最佳的二进制因素的低自动关系二进制序列是一个非常困难的优化问题。 提出并解决了精华算法的改良版本, 以寻找具有良好自相通特性的周期二进制序列。 执行我们的随机算法, 以查找有高功率因素的对称二进制序列, 高性能计算了高性能。 实验后, 我们提出了201至303之间的新二进制序列, 奇长于201至303美元, 优于8.5法郎。 此外, 在201至303年之间, 发现了一个超8美元的双进制序列的例子。 迄今发现, 以 $F > 9美元 最长的二进制序列是255 。