具有高优因子的长反对称二元序列的计算搜索
Computational Searching of Long Skew-symmetric Binary Sequences with High Merit Factors
摘要：
在本文中，我们提出了一个计算搜索的最佳知名的价值因子的较长的二元序列的奇数长度。寻找具有最优或次优价值因子的低自相关二元序列是一个非常困难的优化问题。提出了一种改进的启发式算法，并用于搜索具有良好自相关特性的非周期二元序列。高性能的计算与执行我们的随机算法搜索斜对称二进制序列具有高价值因素。经过实验工作，作为结果，我们提出了新的二进制序列的奇数长度之间的201和303是斜对称的，并具有大于8.5的优良因子$F$。此外，对于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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
