scholarly journals On the stability of periodic binary sequences with zone restriction

Author(s):  
Ming Su ◽  
Qiang Wang

Abstract Traditional global stability measure for sequences is hard to determine because of large search space. We propose the k-error linear complexity with a zone restriction for measuring the local stability of sequences. For several classes of sequences, we demonstrate that the k-error linear complexity is identical to the k-error linear complexity within a zone, while the length of a zone is much smaller than the whole period when the k-error linear complexity is large. These sequences have periods $$2^n$$ 2 n , or $$2^v r$$ 2 v r (r odd prime and 2 is primitive modulo r), or $$2^v p_1^{s_1} \cdots p_n^{s_n}$$ 2 v p 1 s 1 ⋯ p n s n ($$p_i$$ p i is an odd prime and 2 is primitive modulo $$p_i^2$$ p i 2 , where $$1\le i \le n$$ 1 ≤ i ≤ n ) respectively. In particular, we completely determine the spectrum of 1-error linear complexity with any zone length for an arbitrary $$2^n$$ 2 n -periodic binary sequence.

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-7
Author(s):  
Zhixiong Chen ◽  
Qiuyan Wang

Let Fq be the finite field with q=pr elements, where p is an odd prime. For the ordered elements ξ0,ξ1,…,ξq-1∈Fq, the binary sequence σ=(σ0,σ1,…,σq-1) with period q is defined over the finite field F2={0,1} as follows: σn=0,  if  n=0,  (1-χ(ξn))/2,  if  1≤n<q,  σn+q=σn, where χ is the quadratic character of Fq. Obviously, σ is the Legendre sequence if r=1. In this paper, our first contribution is to prove a lower bound on the linear complexity of σ for r≥2, which improves some results of Meidl and Winterhof. Our second contribution is to study the distribution of the k-error linear complexity of σ for r=2. Unfortunately, the method presented in this paper seems not suitable for the case r>2 and we leave it open.


2018 ◽  
Vol 12 (4) ◽  
pp. 805-816 ◽  
Author(s):  
Zhixiong Chen ◽  
◽  
Vladimir Edemskiy ◽  
Pinhui Ke ◽  
Chenhuang Wu ◽  
...  

2018 ◽  
Vol 228 ◽  
pp. 01014
Author(s):  
Chun-e Zhao ◽  
Tongjiang Yan ◽  
Qihua Niu

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.


2020 ◽  
Vol 63 (9) ◽  
Author(s):  
Zhihua Niu ◽  
Can Yuan ◽  
Zhixiong Chen ◽  
Xiaoni Du ◽  
Tao Zhang

Sign in / Sign up

Export Citation Format

Share Document