Item request has been placed!
×
Item request cannot be made.
×
Processing Request
On the linear complexity of generalized cyclotomic binary sequences of length 2 pq.
Item request has been placed!
×
Item request cannot be made.
×
Processing Request
- Author(s): Chang, Zu‐Ling; Li, Dandan
- Source:
Concurrency & Computation: Practice & Experience; Jun2014, Vol. 26 Issue 8, p1520-1530, 11p
- Subject Terms:
- Additional Information
- Abstract:
SUMMARY In this paper, a new class of generalized cyclotomic binary sequences with period of 2 pq is established. The linear complexity and minimal polynomials of proposed sequences of length 2 pq are determined. The results show that such sequences of length 2 pq have high linear complexity. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
- Abstract:
Copyright of Concurrency & Computation: Practice & Experience is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
No Comments.