Exhaustive Search for Optimal Minimum Peak Sidelobe Binary Sequences up to Length 80

DOI10.1007/978-3-319-12325-7_14zbMath1336.94031OpenAlexW2221329233MaRDI QIDQ2945081

Anatolii N. Leukhin, Egor N. Potekhin

Publication date: 9 September 2015

Published in: Sequences and Their Applications - SETA 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12325-7_14

zbMATH Keywords

binary sequencesexhaustive searchmerit factoraperiodic autocorrelation functionminimum peak sidelobe

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (1)

Sequences with small correlation

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Almost difference sets and reversible divisible difference sets
• Metaheuristic optimization via memory and evolution. Tabu search and scatter search.
• Constructions of almost difference sets from finite fields
• Exploiting relaxation in local search for LABS
• Bounds on the growth rate on the peak sidelobe level of binary sequences
• The merit factor problem
• Autocorrelations of Random Binary Sequences
• The peak sidelobe level of families of binary sequences
• On the ground states of the Bernasconi model
• Variable Neighborhood Search
• Almost difference sets and their sequences with optimal autocorrelation
• Binary Sequences With Small Peak Sidelobe Level
• The peak sidelobe level of random binary sequences
• On the Correlation Function of Random Binary Sequences

This page was built for publication: Exhaustive Search for Optimal Minimum Peak Sidelobe Binary Sequences up to Length 80