1996/09/21 by S Mertens
Computer Science · Mathematics · #Cellular Automata and Applications #Computability, Logic, AI Algorithms #Random Matrices and Applications
paper · doi:10.1088/0305-4470/29/18/005
openalex publication_date 1996/09/21 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/30
Binary sequences with low autocorrelations are important in communication engineering and in statistical mechanics as ground states of the Bernasconi model. Computer searches are the main tool in the construction of such sequences. Owing to the exponential size of the configuration space, exhaustive searches are limited to short sequences. We discuss an exhaustive search algorithm with run-time characteristic and apply it to compile a table of exact ground states of the Bernasconi model up to N = 48. The data suggest F > 9 for the optimal merit factor in the limit .