Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Any Order

2011/08/22 by Tongjiang Yan, Yan, Tongjiang
Computer Science · Mathematics · Engineering · #Coding theory and cryptography #Finite Group Theory Research #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1108.4450

Abstract

This paper gives the linear complexity of binary Ding-Helleseth generalized cyclotomic sequences of any order.

Related

• About the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period
• Linear complexity of generalized cyclotomic sequences of period 2p^m
• The linear complexity of new binary cyclotomic sequences of period pⁿ
• On error linear complexity of new generalized cyclotomic binary sequences of period p²
• A further study on the linear complexity of new binary cyclotomic sequence of length p^r