The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
Low-autocorrelation binary sequences: On improved merit factors and runtime predictions to achieve them
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This scaling closely matches the one reported in (30).”
From Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem (2024) · cites this paper as [30]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“The best-known heuristic for general LABS is tabu search initialized with a memetic algorithm (Memetic Tabu) (23), and has a running time that scales as 1.34N (30).”
From Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem (2024) · cites this paper as [30]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The R Project in Statistical Computing
Ripley, B. D. (2001) · MSOR Connections · doi:10.11120/msor.2001.01010023 · Cited by 2,681
Random-energy model: An exactly solvable model of disordered systems
Derrida, B. (1981) · Physical review. B, Condensed matter · doi:10.1103/physrevb.24.2613 · Cited by 1,363
Madras, N., & Slade, G. (1996) · Springer eBooks · doi:10.1007/978-1-4612-4132-4 · Cited by 698
Tufte, E. R. (2006) · Cited by 595
Gross, D. J., & Mézard, M. (1984) · Nuclear Physics B · doi:10.1016/0550-3213(84)90237-2 · Cited by 497
Landscapes and their correlation functions
Stadler, P. F. (1996) · Journal of Mathematical Chemistry · doi:10.1007/bf01165154 · Cited by 255
Some problems in real and complex analysis
Littlewood, J. E. (1968) · Medical Entomology and Zoology · Cited by 227
Sieves for low autocorrelation binary sequences
Golay, M. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055653 · Cited by 225
The merit factor of long low autocorrelation binary sequences (Corresp.)
Golay, M. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056505 · Cited by 196
Low autocorrelation binary sequences : statistical mechanics and configuration space analysis
Bernasconi, J. (1987) · Journal de physique · doi:10.1051/jphys:01987004804055900 · Cited by 188
Probability Models and Applications
Olkin, I., Gleser, L. J., & Derman, C. (2016) · WORLD SCIENTIFIC eBooks · doi:10.1142/10315 · Cited by 161
Computational excursions in analysis and number theory
Borwein, P. (2003) · Choice Reviews Online · doi:10.5860/choice.40-4056 · Cited by 158
Replica field theory for deterministic models: I. Binary sequences with low autocorrelation
Marinari, E., Giorgio Parisi, A., & Ritort, F. (1994) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/27/23/010 · Cited by 144
Hierarchical BOA Solves Ising Spin Glasses and MAXSAT
Pelikán, M., & Goldberg, D. E. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45110-2_3 · Cited by 140
Computational Excursions in Analysis and Number Theory
Borwein, P. (2002) · Springer eBooks · doi:10.1007/978-0-387-21652-2 · Cited by 124
Exhaustive Search for Low-Autocorrelation Binary SequencesPreprint
Mertens, S. (1996) · Cited by 98
A class of finite binary sequences with alternate auto-correlation values equal to zero (Corresp.)
Golay, M. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054797 · Cited by 96
The merit factor of Legendre sequences (Corresp.)
Golay, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056744 · Cited by 91
Exhaustive search for low-autocorrelation binary sequences
Mertens, S. (1996) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/29/18/005 · Cited by 91
A Survey of the Merit Factor Problem for Binary Sequences
Jedwab, J. (2005) · Lecture notes in computer science · doi:10.1007/11423461_2 · Cited by 90
Evolutionary search for low autocorrelated binary sequences
Militzer, B., Zamparelli, M., & Beule, D. (1998) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.728212 · Cited by 85
The merit factor of binary sequences related to difference sets
Jensen, J. M., Jensen, H. E., & Høholdt, T. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.79917 · Cited by 81
Trastoy, J., Malnou, M., Ulysse, C., et al. (2014) · Nature Nanotechnology · doi:10.1038/nnano.2014.158 · Cited by 74
Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies
de Groot, C., Würtz, D., & Hoffmann, K. H. (1992) · Optimization · doi:10.1080/02331939208843771 · Cited by 68
Binary Sequences With Merit Factor Greater Than $6.34$
Borwein, P., Choi, K., & Jedwab, J. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838341 · Cited by 66
Principles and Practice of Constraint Programming
Hutchison, D., Weikum, G., Vardi, M. Y., et al. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85958-1 · Cited by 66
Efficient Implementation of the Pivot Algorithm for Self-avoiding Walks
Clisby, N. (2010) · Journal of Statistical Physics · doi:10.1007/s10955-010-9994-8 · Cited by 64
Low autocorrelation binary sequences
Packebusch, T., & Mertens, S. (2016) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/49/16/165001 · Cited by 64
Finding low autocorrelation binary sequences with memetic algorithms
Gallardo, J. E., Cotta, C., & Fernández, A. J. (2009) · Applied Soft Computing · doi:10.1016/j.asoc.2009.03.005 · Cited by 59
A new search for skewsymmetric binary sequences with optimal merit factors
Golay, M. J. E., & Harris, D. B. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.57219 · Cited by 58
Genetic and Evolutionary Computation — GECCO 2003
Cantú-Paz, E., Miller, J., Jonoska, N., Dowsland, K. A., Schultz, A. C., Potter, M. A., Dasgupta, D., Wegener, J., Harman, M., Wilson, S., et al. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45110-2 · Cited by 41
Optimization on Rugged Landscapes: A New General Purpose Monte Carlo Approach
Dittes, F.-M. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.4651 · Cited by 39
Efficient Optimization of the Merit Factor of Long Binary Sequences
Baden, J. M. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2164778 · Cited by 38
Advances in the merit factor problem for binary sequences
Jedwab, J., Katz, D. J., & Schmidt, K. (2013) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2013.01.010 · Cited by 37
The self-avoiding walk: A brief survey
Slade, G. (2011) · EMS series of congress reports · doi:10.4171/072-1/9 · Cited by 36
Engineering Stochastic Local Search for the Low Autocorrelation Binary Sequence Problem
Halim, S. A., Yap, R. H. C., & Halim, F. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85958-1_57 · Cited by 30
Bi-alphabetic pulse compression radar signal design
Pasha, I. A., Moharir, P. S., & Rao, N. S. (2000) · Sadhana · doi:10.1007/bf02703629 · Cited by 25
Littlewood polynomials with small L4 norm
Jedwab, J., Katz, D. J., & Schmidt, K. (2013) · Advances in Mathematics · doi:10.1016/j.aim.2013.03.015 · Cited by 25
Brglez, F., Li, X. Y., Stallmann, M. F. M., et al. (2003) · Cited by 23
Self-citationA Memetic Approach to Golomb Rulers
Cotta, C., Dotú, I., Fernández, A. J., et al. (2006) · Lecture notes in computer science · doi:10.1007/11844297_26 · Cited by 18
Ukil, A. (2009) · Digital Signal Processing · doi:10.1016/j.dsp.2009.08.003 · Cited by 18
Binary Sequences With Merit Factor $≫ 6.3$
Kristiansen, R. A., & Parker, M. G. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838343 · Cited by 18
A statistical mechanics analysis of the set covering problem
Fontanari, J. F. (1996) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/29/3/004 · Cited by 15
Borwein, P., Ferguson, R., & Knauer, J. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721274.006 · Cited by 14
Barker sequences of odd length
Schmidt, K., & Willms, J. (2015) · Designs Codes and Cryptography · doi:10.1007/s10623-015-0104-4 · Cited by 12
Censoring in theory and practice: statistical perspectives and controversies
Sen, P. K. (1995) · Lecture notes-monograph series · doi:10.1214/lnms/1215452220 · Cited by 11
Surveys in Stochastic Processes
Blath, J., Imkeller, P., & Rœlly, S. (2011) · EMS series of congress reports · doi:10.4171/072 · Cited by 11
Rúnarsson, T. P., Beyer, H.-G., Burke, E., et al. (2006) · Lecture notes in computer science · doi:10.1007/11844297 · Cited by 11
Exploiting relaxation in local search for LABS
Prestwich, S. (2007) · Annals of Operations Research · doi:10.1007/s10479-007-0226-9 · Cited by 10
Improved Branch-and-Bound for Low Autocorrelation Binary SequencesPreprint
Prestwich, S. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1305.6187 · Cited by 9
Littlewood Polynomials with Small $L^4$ NormPreprint
Jedwab, J., Katz, D. J., & Schmidt, K. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.0260 · Cited by 8
Of n-dimensional Dice, Combinatorial Optimization, and Reproducible Research: An Introduction
Brglez, F. (2011) · Cited by 3
Self-citationBrglez, F., Boškovič, B., & Brest, J. (2017) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2017.7969417 · Cited by 3
Self-citationOn Self-Avoiding Walks across n-Dimensional Dice and Combinatorial Optimization: An IntroductionPreprint
Brglez, F. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.7508 · Cited by 2
Self-citationNew sets of binary and ternary sequences with low correlation
Krengel, E. I., Tirkel, A. Z., & Hall, T. E. (2005) · Lecture notes in computer science · doi:10.1007/11423461 · Cited by 2
Flagged first, then by citations
Research works printed but not linked: 3
- Beenker, 1985, Binary sequences with a maximally flat amplitude spectrum, Philips J. Res., 40, 289
- F. Brglez, J. Brest, B. Bošković, xBed: An Open Environment for Design and Experiments with Combinatorial Solvers, A preprint available from the authors.
- F. Brglez, On Stochastic Combinatorial Optimization and Markov Chains: From Walks with Self-Loops to Self-Avoiding Walks, A preprint available from the author.
Cited by
Sorted by citations
Shaydulin, R., Li, C., Chakrabarti, S., DeCross, M., Herman, D., Kumar, N., Larson, J., Lykov, D., Minssen, P., Sun, Y., et al. (2024) · Science Advances · doi:10.1126/sciadv.adm6761 · Cited by 120
“34 N (30).”
Metadata
- Authors
- Bošković, B., Brglez, F., & Brest, J.
- Affiliations
- North Carolina State University (US)
- University of Maribor (SI)
- ORCID
- Brest, Janez
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2017-07
- Volume
- 56
- Pages
- 262-285
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W2278999310
- Cited by
- 31
- References
- 55
- Citations by year
- 2026: 1 · 2025: 4 · 2024: 6 · 2023: 1 · 2022: 4 · 2021: 5 · 2020: 2 · 2019: 2 · 2018: 2 · 2017: 4
- FWCI
- 1.57
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Applied Soft Computing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Slovenian Research Agency
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Constraint Satisfaction and Optimization
- Keywords
- low autocorrelation binary sequences, merit factor, tabu search, self-avoiding walks
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
