Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies

DOI10.1080/02331939208843771zbMath0814.90100OpenAlexW2081808886MaRDI QIDQ4327898

Karl Heinz Hoffmann, Diethelm Würtz, Class de Groot

Publication date: 11 June 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843771

zbMATH Keywords

low autocorrelation binary sequencesmerit factorsoptimization by evolutionary strategies

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Communication, information (94A99)

Related Items (1)

Exploiting relaxation in local search for LABS

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Sieves for low autocorrelation binary sequences
• A class of finite binary sequences with alternate auto-correlation values equal to zero (Corresp.)

This page was built for publication: Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies