Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
395394 | Information Sciences | 2008 | 9 Pages |
Abstract
Whiteman generalized cyclotomic sequences are proven to exhibit a number of good randomness properties. In this paper we determine the linear complexity of some newly generalized cyclotomic sequences, of order four with period pq which are defined by Ding and Helleseth. The results show that all of these sequences have high linear complexity.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Tongjiang Yan, Li Hong, Guozhen Xiao,