Binary Sequences with Minimum Peak Sidelobe Level up to Length 68

2012/12/20 by Anatolii N. Leukhin, Leukhin, Anatolii, Egor Potehin +1
Business, Management and Accounting · Engineering · #FOS: Computer and information sciences #Optics and Image Analysis #Optimization and Packing Problems #Other Computer Science (cs.OH)

paper · pdf · doi:10.48550/arxiv.1212.4930

openalex publication_date 2012/12/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Results of an exhaustive search for minimum peak sidelobe level binary sequences are presented. Several techniques for efficiency implementation of search algorithm are described. A table of number of non-equivalent optimal binary sequences with minimum peak sidelobe (MPS) level up to length 68 is given. This number can be used in prediction of the longest length for a given sidelobe level of binary sequences. The examples of optimal binary MPS sequences having high merit factor are shown.

Related

• Hybrid Constructions of Binary Sequences with Low Autocorrelation Sidelobes
• Dual-Step Optimization for Binary Sequences with High Merit Factors
• Improved bounds on the peak sidelobe level of binary sequences
• New Classes of Binary Sequences with High Merit Factor
• Exhaustive search for low-autocorrelation binary sequences