Abstract
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.
Subject
General Physics and Astronomy
Reference16 articles.
1. Two costructions of binary sequences with optimal autocorrelation magnitude;Krengel;Electron. Lett.,2016
2. Some k-valued pseudo-random sequences and nearly equidistant codes;Sidelnikov;Probl. Inf. Transm.,1969
3. A class of balanced binary sequences with optimal autocorrelation property;Lempel;IEEE Trans. Inf. Theory,1977
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献