Linear Complexity of Generalized Cyclotomic Sequences of Order 4 over Fl
Generalized cyclotomic sequences of period pq have several desirable randomness properties if the two primes p and q are chosen properly. In particular, Ding deduced the exact formulas for the autocorrelation and the linear complexity of these sequences of order 2. In this paper, we consider the gen...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2020/6963487 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Generalized cyclotomic sequences of period pq have several desirable randomness properties if the two primes p and q are chosen properly. In particular, Ding deduced the exact formulas for the autocorrelation and the linear complexity of these sequences of order 2. In this paper, we consider the generalized sequences of order 4. Under certain conditions, the linear complexity of these sequences is developed over a finite field Fl. The results show that, in many cases, they have high linear complexity. |
|---|---|
| ISSN: | 1076-2787 1099-0526 |