低自相关二元序列
Low Autocorrelation Binary Sequences
摘要：
具有最小自相关的二进制序列在通信工程、数学和计算机科学中有着广泛的应用。在统计物理学中，它们以Bernasconi模型的基态出现。寻找这些序列是一个众所周知的难题，到目前为止只能通过穷举搜索来解决。我们回顾了最近的算法，并提出了一个新的算法，发现最佳的序列长度$N$在时间$Θ(N\,1.73^N)$。我们计算了$N\leq 66$的所有最优序列和$N\leq 119$的所有最优反对称序列。
英文摘要：
Binary sequences with minimal autocorrelations have applications in communication engineering, mathematics and computer science. In statistical physics they appear as groundstates of the Bernasconi model. Finding these sequences is a notoriously hard problem, that so far can be solved only by exhaustive search. We review recent algorithms and present a new algorithm that finds optimal sequences of length $N$ in time $Θ(N\,1.73^N)$. We computed all optimal sequences for $N\leq 66$ and all optimal skewsymmetric sequences for $N\leq 119$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
