Linear complexity of binary sequences with optimal autocorrelation magnitude of length 4N
Vladimir Edemskiy, Aleksey Minin · Journal of Physics Conference Series · 2019
Abstract In this paper, we study the linear complexity of series of binary sequences with optimal autocorrelation magnitude of length 4N. These sequences are obtained from almost-perfect binary sequences and binary sequences with optimal autocorrelation of length N. The construction of these sequences were presented E.I. Krengel and P.V. Ivanov. We show that considered sequences have the high linear complexity. Also we derive the 1-error linear complexity of these sequences.