English

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

Information Theory 2012-07-27 v1 Cryptography and Security math.IT
Authors: Vladimir Edemskiy
View on arXiv ↗ PDF ↗

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.

Keywords

linear complexity Ding-Helleseth sequences generalized cyclotomies binary sequences arbitrary period sufficient conditions

Cite

@article{arxiv.1207.6380,
  title  = {About the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period},
  author = {Vladimir Edemskiy},
  journal= {arXiv preprint arXiv:1207.6380},
  year   = {2012}
}

Related papers

View all related →
Information Theory · Computer Science
Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Any Order
Tongjiang Yan
2011-08-24
Information Theory · Computer Science
Linear complexity of generalized cyclotomic sequences of period $2p^{m}$
Yi Ouyang, Xianhong Xie
2018-08-27
Number Theory · Mathematics
Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products
Ming Yan, Tongjiang Yan, Yu Li
2019-12-16
Information Theory · Computer Science
On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences
Lulu Zhang, Jun Zhang, Minghui Yang, Keqin Feng
2019-04-12
Number Theory · Mathematics
Note about the linear complexity of new generalized cyclotomic binary sequences of period $2p^n$
Vladimir Edemskiy
2020-12-30
Number Theory · Mathematics
Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight
Yana Liang, Jiali Cao, Xingfa Chen, Shiping Cai +1
2020-02-18
Information Theory · Computer Science
Linear complexity of generalized cyclotomic sequences of order 4 over F_l
Yuhua Sun, Yang Yan, Fei Li, Tongjiang Yan +1
2016-05-18
Discrete Mathematics · Computer Science
Corrigendum to New Generalized Cyclotomic Binary Sequences of Period $p^2$
Zibi Xiao, Xiangyong Zeng, Chunlei Li, Tor Helleseth
2018-07-10
Cryptography and Security · Computer Science
Linear complexity of quaternary sequences over Z4 based on Ding-Helleseth generalized cyclotomic classes
Xina Zhang, Xiaoni Du, Chenhuang Wu
2018-05-23
Information Theory · Computer Science
Linear complexity over ${\mathbb{F}_{{q}}}$ and 2-adic complexity of a class of binary generalized cyclotomic sequences with low-value autocorrelation
Yan Wang, Xilin Han, Weiqiong Wang, Ziling Heng
2021-09-10
Cryptography and Security · Computer Science
A New Method to Compute the 2-adic Complexity of Binary Sequences
Hai Xiong, Longjiang Qu, Chao Li
2013-09-09
Information Theory · Computer Science
Determination of 2-Adic Complexity of Generalized Binary Sequences of Order 2
Minghui Yang, Keqin Feng
2020-07-31
Number Theory · Mathematics
On the linear complexity for multidimensional sequences
Domingo Gómez-Pérez, Min Sha, Andrew Tirkel
2018-07-30
Number Theory · Mathematics
The linear complexity of new binary cyclotomic sequences of period $p^n$
Vladimir Edemskiy
2017-12-13
Information Theory · Computer Science
Further Investigations on Nonlinear Complexity of Periodic Binary Sequences
Qin Yuan, Chunlei Li, Xiangyong Zeng, Tor Helleseth +1
2024-04-26
Cryptography and Security · Computer Science
On error linear complexity of new generalized cyclotomic binary sequences of period $p^2$
Chenhuang Wu, Chunxiang Xu, Zhixiong Chen, Pinhui Ke
2018-04-24
Information Theory · Computer Science
A class of cyclotomic linear codes and their generalized Hamming weights
Fei Li
2022-06-17
Combinatorics · Mathematics
Complexity of Substitutive Sequences - Calculation of the Complexities of Substitutive Sequences Over a Binary Alphabet
Bo Tan, Zhi-Xiong Wen, Yiping Zhang
2015-07-16
Cryptography and Security · Computer Science
On the Linear Complexity of Generalized Cyclotomic Quaternary Sequences with Length $2pq$
Minglong Qi, Shengwu Xiong, Jingling Yuan, Wenbi Rao +1
2016-03-01
Information Theory · Computer Science
On the 2-adic complexity of a class of binary sequences of period $4p$ with optimal autocorrelation magnitude
Minghui Yang, Lulu Zhang, Keqin Feng
2019-05-01
Information Theory · Computer Science
A kind of quaternary sequences of period $2p^mq^n$ and their linear complexity
Qiuyan Wang, Chenhuang Wu, Minghui Yang, Yang Yan
2020-01-30
Information Theory · Computer Science
A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period $p^n$
Yuhua Sun, Qiang Wang, Tongjiang Yan, Chun'e Zhao
2017-04-26
Information Theory · Computer Science
Linear Complexity of Binary Interleaved Sequences of Period 4n
Qiuyue Liu, Shiyuan Qiang, Minghui Yang, Keqin Feng
2021-05-31
Information Theory · Computer Science
Binary sequences with length n and nonlinear complexity not less than n/2
Sicheng Liang, Xiangyong Zeng, Zibi Xiao, Zhimin Sun
2023-12-27
Cryptography and Security · Computer Science
A further study on the linear complexity of new binary cyclotomic sequence of length $p^r$
Zhifan Ye, Pinhui Ke, Chenhuang Wu
2018-03-16