1975Electronics LettersRequires access

Binary sequences up to length 40 with best possible autocorrelation function

J. Lindner

Open publisher page 166 citations

Abstract

The problem of finding binary sequences with autocorrelation sidelobes as small as possible for any given length of the sequence is still unsolved today. However, solutions were found up to length 40 by exhaustive searching with the aid of a special minicomputer.

About this research paper

What this paper is about

The problem of finding binary sequences with autocorrelation sidelobes as small as possible for any given length of the sequence is still unsolved today. However, solutions were found up to length 40 by exhaustive searching with the aid of a special minicomputer.

Why it matters

OpenAlex reports 166 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The problem of finding binary sequences with autocorrelation sidelobes as small as possible for any given length of the sequence is still unsolved today. However, solutions were found up to length 40 by exhaustive searching with the aid of a special minicomputer.

Key concepts: Autocorrelation, Binary number, Autocorrelation technique, Sequence (biology), Pseudorandom binary sequence, Complementary sequences, Autocorrelation matrix, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Binary sequences up to length 40 with best possible autocorrelation function — Research Paper | ScholarLens