A note on low autocorrelation binary sequences

Authors:
Iván Dotú;Pascal Van Hentenryck
Affiliations:
Departamento De Ingeniería Informática, Universidad Autónoma de Madrid;Brown University, Providence, RI
Venue:
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Year:
2006

Citing 1
Cited 5

A Hybrid Seachr Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming

A memetic algorithm for the low autocorrelation binary sequence problem

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Engineering Stochastic Local Search for the Low Autocorrelation Binary Sequence Problem

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Finding low autocorrelation binary sequences with memetic algorithms

Applied Soft Computing
Low autocorrelation binary sequences: Number theory-based analysis for minimum energy level, Barker codes

Digital Signal Processing
GRASP for low autocorrelated binary sequences

ICIC'10 Proceedings of the 6th international conference on Advanced intelligent computing theories and applications: intelligent computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Low Autocorrelation Binary Sequences problem (LABS) is problem 005 in the CSPLIB library, where it is stated that “these problems pose a significant challenge to local search methods”. This paper presents a straighforward tabu search that systematically finds the optimal solutions for all tested instances.