About the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period

2012/07/26 by Edemskiy, Vladimir
#11B50 #94A55 #94A60 #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1207.6380

Abstract

We defined sufficient conditions for designing Ding-Helleseth sequences with arbitrary period and high linear complexity for generalized cyclotomies. Also we discuss the method of computing the linear complexity of Ding-Helleseth sequences in the general case.

Related

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