Linear Complexity of Generalized Cyclotomic Sequences of Order 4 over

Yuhua Sun, Qiuyan Wang, Yang Yan, Tongjiang Yan and Hui Li

Complexity, 2020, vol. 2020, 1-8

Abstract:

Generalized cyclotomic sequences of period 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 . The results show that, in many cases, they have high linear complexity.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/6963487.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/6963487.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:6963487

DOI: 10.1155/2020/6963487

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().