Exhaustive search for low-autocorrelation binary sequences
From MaRDI portal
Publication:4393618
DOI10.1088/0305-4470/29/18/005zbMath0898.94006arXivcond-mat/9605050OpenAlexW3123262202MaRDI QIDQ4393618
No author found.
Publication date: 4 November 1998
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/9605050
binary sequencessearch algorithmexact ground statesBernasconi modelcommunication engineeringIsing-spinslow autocorrelations
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Exploiting relaxation in local search for LABS ⋮ Explicit merit factor formulae for Fekete and Turyn polynomials ⋮ Rudin-Shapiro-like polynomials in $L_{4}$
This page was built for publication: Exhaustive search for low-autocorrelation binary sequences
