Binary sequences up to length 40 with best possible autocorrelation function
J. Lindner
Abstract
J. Lindner
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.
OpenAlex reports 166 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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