1.3k citations · 1.9k across the 16 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024★ 1 cited
Dual-Step Optimization for Binary Sequences with High Merit Factors
Blaž Pšeničnik, Rene Mlinarič, Janez Brest +1
The problem of finding aperiodic low auto-correlation binary sequences (LABS) presents a significant computational challenge, particularly as the sequence length increases. Such se…
cs.DS2014★ 29 cited
Low-Autocorrelation Binary Sequences: On Improved Merit Factors and Runtime Predictions to Achieve Them
Borko Bošković, Franc Brglez, Janez Brest
The search for binary sequences with a high figure of merit, known as the low autocorrelation binary sequence (}) problem, represents a formidable computational challenge. To…