Low autocorrelation binary sequences

From MaRDI portal



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 Theta(N,1.73N). We computed all optimal sequences for Nleq66 and all optimal skewsymmetric sequences for Nleq119.











This page was built for publication: Low autocorrelation binary sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186616)