Low autocorrelation binary sequences
Tom Packebusch, Stephan Mertens
Source record
Source: Crossref
Published: Mar 8, 2016
DOI: 10.1088/1751-8113/49/16/165001
Open original source ↗Source abstract
Abstract 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 . We computed all optimal sequences for and all optimal skewsymmetric sequences for .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.