Linear complexity of generalized cyclotomic sequences of period 2p^m

2018/08/24 by Ouyang, Yi, Xie, Xianhong
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1808.08019

Abstract

In this paper, we construct two generalized cyclotomic binary sequences of period 2p^m based on the generalized cyclotomy and compute their linear complexity, showing that they are of high linear complexity when m≥ 2.

Related

• 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
• About the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period
• Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Any Order
• Autocorrelation and Linear Complexity of Quaternary Sequences of Period 2p Based on Cyclotomic Classes of Order Four