scholarly journals Linear Complexity over Fq of Generalized Cyclotomic Quaternary Sequences with Period 2p

2015 ◽  
Vol E98.A (7) ◽  
pp. 1569-1575 ◽  
Author(s):  
Minglong QI ◽  
Shengwu XIONG ◽  
Jingling YUAN ◽  
Wenbi RAO ◽  
Luo ZHONG
Keyword(s):  
Linear Complexity ◽  
Quaternary Sequences ◽  
Period 2

scholarly journals New Generalized Cyclotomic Quaternary Sequences with Large Linear Complexity and a Product of Two Primes Period

Information ◽  
2021 ◽  
Vol 12 (5) ◽  
pp. 193
Author(s):  
Jiang Ma ◽  
Wei Zhao ◽  
Yanguo Jia ◽  
Haiyang Jiang
Keyword(s):  
Spectral Sequence ◽  
Linear Complexity ◽  
Residue Class ◽  
Important Criterion ◽  
Random Sequences ◽  
Gray Mapping ◽  
Quaternary Sequences ◽  
Hamming Weights ◽  
Residue Class Ring ◽  
Class Ring

Linear complexity is an important criterion to characterize the unpredictability of pseudo-random sequences, and large linear complexity corresponds to high cryptographic strength. Pseudo-random Sequences with a large linear complexity property are of importance in many domains. In this paper, based on the theory of inverse Gray mapping, two classes of new generalized cyclotomic quaternary sequences with period pq are constructed, where pq is a product of two large distinct primes. In addition, we give the linear complexity over the residue class ring Z4 via the Hamming weights of their Fourier spectral sequence. The results show that these two kinds of sequences have large linear complexity.

Linear complexity of generalised cyclotomic quaternary sequences of length 2p m+1 q n+1

2016 ◽  
Vol 10 (2) ◽  
pp. 104-111
Author(s):  
Dan-dan Li ◽  
Qiao-yan Wen ◽  
Zu-ling Chang ◽  
Jie Zhang
Keyword(s):  
Linear Complexity ◽  
Quaternary Sequences

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