Paper Info
Title
Linear Complexity of Binary Generalized Cyclotomic Sequences of Order 6 over Zpq
Abstract
Binary White man cyclotomic sequences of orders 2 and 4 over Zpq have a number of good randomness properties. In this paper we calculate the linear complexity (linear span) of binary generalized cyclotomic sequences of order 6. Our results show that their linear complexity is quite good.
Year
DOI
Venue
2013
10.1109/INCoS.2013.119
INCoS
Keywords
Field
DocType
generalized cyclotomic sequences,linear span,linear complexity,binary generalized cyclotomic sequence,stream cipher,computational complexity,binary generalized cyclotomic sequences,linear span complexity,polynomials,randomness property,binary white man cyclotomic,good randomness property
Discrete mathematics,Linear span,Polynomial,Computer science,Stream cipher,Linear complexity,Computational complexity theory,Randomness,Binary number,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
2
Authors
2
Name
Order
Citations
PageRank
Tongjiang Yan184.07
Yanyan Liu212.80