| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 394822 | Information Sciences | 2009 | 5 Pages |
Abstract
In this correspondence, we obtain the linear complexity and minimal polynomials of binary Whiteman generalized cyclotomic sequences of order 2k, where k > 1. Our result shows that all of these sequences possess large linear complexity.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Tongjiang Yan, Xiaoni Du, Guozhen Xiao, Xiaolong Huang,