本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2016-03-08
摘要
Binary sequences with minimal autocorrelations have applications in communication engineering, mathematics and computer science. In 統計 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 O(N 1.73(N)). We computed all optimal sequences for N <= 66 and all optimal skewsymmetric sequences for N <= 119.
※ 此為已發表論文，全文需透過期刊付費取得