An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/

1993 ◽  
Vol 39 (4) ◽  
pp. 1398-1401 ◽  
Author(s):  
M. Stamp ◽  
C.F. Martin
Keyword(s):  
Linear Complexity ◽  
Binary Sequences ◽  
Period 2 ◽  
Error Linear Complexity

On the error linear complexity profiles of binary sequences of period 2n

2008 ◽  
Author(s):  
Tuvi Etzion ◽  
Nicholas Kalouptsidis ◽  
Nicholas Kolokotronis ◽  
Konstantinos Limniotis ◽  
Kenneth G. Paterson
Keyword(s):  
Linear Complexity ◽  
Binary Sequences ◽  
Period 2 ◽  
Error Linear Complexity

scholarly journals On $k$-error linear complexity of pseudorandom binary sequences derived from Euler quotients

2018 ◽  
Vol 12 (4) ◽  
pp. 805-816 ◽  
Author(s):  
Zhixiong Chen ◽  
◽  
Vladimir Edemskiy ◽  
Pinhui Ke ◽  
Chenhuang Wu ◽  
...  
Keyword(s):  
Linear Complexity ◽  
Binary Sequences ◽  
Error Linear Complexity

scholarly journals Linear Complexity of the Balanced Polynomial Quotients Sequences

2018 ◽  
Vol 228 ◽  
pp. 01014
Author(s):  
Chun-e Zhao ◽  
Tongjiang Yan ◽  
Qihua Niu
Keyword(s):  
Lower Bound ◽  
Communication Systems ◽  
Linear Complexity ◽  
Binary Sequences ◽  
The Past ◽  
Error Linear Complexity

Balanced binary sequences of large linear complexity have series applications in communication systems. In the past, although the sequences derived from polynomial quotients have large linear complexity, but they are not balanced. In this paper, we will construct new sequences which are not only with large linear complexity but also balanced. Meanwhile, this linear complexity reaches the known k-error linear complexity mentioned in [7], which means that the k-error linear complexity as a lower bound is tight.

On the k-error linear complexity of 2p2-periodic binary sequences

2020 ◽  
Vol 63 (9) ◽  
Author(s):  
Zhihua Niu ◽  
Can Yuan ◽  
Zhixiong Chen ◽  
Xiaoni Du ◽  
Tao Zhang
Keyword(s):  
Linear Complexity ◽  
Binary Sequences ◽  
Error Linear Complexity

An Efficient Algorithm for Computing the k-Error Linear Complexity Spectrum of Periodic Sequences

2012 ◽  
Vol 532-533 ◽  
pp. 1726-1731
Author(s):  
Ling Yong Ma ◽  
Hao Cao
Keyword(s):  
Efficient Algorithm ◽  
Linear Complexity ◽  
Primitive Root ◽  
Periodic Sequences ◽  
Period 2 ◽  
Primitive Root Modulo ◽  
Modulo P ◽  
Error Linear Complexity ◽  
Error Linear Complexity Spectrum

An efficient algorithm for computing the k-error linear complexity spectrum of a q- ary sequence s with period 2 pn is presented, where q is an odd prime and a primitive root modulo p2. The algorithm generalizes both the Wei-Xiao-Chen and the Wei algorithms, The new algorithm can compute the k-error linear complexity spectrum of s using at most 4 n+1 steps.

Sign in / Sign up

Export Citation Format

Share Document