Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies
- 1 January 1992
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 23 (4) , 369-384
- https://doi.org/10.1080/02331939208843771
Abstract
We investigate skew-symmetric sequences with chain lengths up to N = 71, giving a complete table of all merit factors F≥7 and their associated configurations. We also calculate the exact thermodynami-cal properties of shorter chains (N≤55). We then introduce an evolutionary strategy, describing the properties of our search algorithm and comparing our results to those of other heuristic methods such as simulated annealing. We find the highest merit factors ever reached for chains of length 81≤N≤201.Keywords
This publication has 11 references indexed in Scilit:
- Simulated Annealing for ?spin-glass-like? optimization problemsZeitschrift für Physik B Condensed Matter, 1987
- Optimization by simulating molecular evolutionBiological Cybernetics, 1987
- Low autocorrelation binary sequences : statistical mechanics and configuration space analysisJournal de Physique, 1987
- Residual Energies after Slow Cooling of Disordered SystemsPhysical Review Letters, 1986
- Cooling-Rate Dependence for the Spin-Glass Ground-State Energy: Implications for Optimization by Simulated AnnealingPhysical Review Letters, 1986
- Optimization by Simulated AnnealingScience, 1983
- The merit factor of long low autocorrelation binary sequences (Corresp.)IEEE Transactions on Information Theory, 1982
- Sieves for low autocorrelation binary sequencesIEEE Transactions on Information Theory, 1977
- Numerische Optimierung von Computer-Modellen mittels der EvolutionsstrategiePublished by Springer Nature ,1977
- A class of finite binary sequences with alternate auto-correlation values equal to zero (Corresp.)IEEE Transactions on Information Theory, 1972