Open AccessLinear complexity of binary sequences with optimal autocorrelation magnitude of length 4N
Author(s) -
Vladimir Edemskiy,
Aleksey Minin
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1352/1/012013
Subject(s) - autocorrelation , mathematics , binary number , complementary sequences , pseudorandom binary sequence , combinatorics , autocorrelation matrix , series (stratigraphy) , magnitude (astronomy) , algorithm , statistics , biology , arithmetic , physics , paleontology , astronomy
In this paper, we study the linear complexity of series of binary sequences with optimal autocorrelation magnitude of length 4 N . 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.