On the linear complexity of a new class of binary cyclotomic sequences having order
Main Article Content
Abstract
Several reasonably cyclotomic sequences are constructed by cyclotomic classes with good
pseudo-randomness property. During this paper, we derive the linear complexity of a new
binary cyclotomic sequences of order 2lt over finite field having period pq. Our result shows
that these sequences have high linear complexity, which can resist linear attack.
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
