English
Related papers

Related papers: Linear Complexity of Binary Interleaved Sequences …

200 papers

The autocorrelation and the linear complexity of a key stream sequence in a stream cipher are important cryptographic properties. Many sequences with these good properties have interleaved structure, three classes of binary sequences of…

Cryptography and Security · Computer Science 2018-01-29 Shidong Zhang , Tongjiang Yan

Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period $4p$ with optimal autocorrelation was proposed…

Information Theory · Computer Science 2018-01-03 Cuiling Fan

In 2008, a class of binary sequences of period $N=4(2^k-1)(2^k+1)$ with optimal autocorrelation magnitude has been presented by Yu and Gong based on an $m$-sequence, the perfect sequence $(0,1,1,1)$ of period $4$ and interleaving technique.…

Information Theory · Computer Science 2020-09-17 Yuhua Sun , Tongjiang Yan , Qiuyan Wang

Tang and Ding \cite{X. Tang} present a series of quaternary sequences $w(a, b)$ interleaved by two binary sequences $a$ and $b$ with ideal autocorrelation and show that such interleaved quaternary sequences have optimal autocorrelation. In…

Information Theory · Computer Science 2021-09-29 Shiyuan Qiang , Xiaoyan Jing , Minghui Yang , Keqin Feng

Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences of period $4p$ with optimal autocorrelation magnitude was constructed in \cite{W. Su}. Later, Fan showed that the linear complexity of this class of sequences is…

Information Theory · Computer Science 2019-05-01 Minghui Yang , Lulu Zhang , Keqin Feng

Binary sequences with optimal autocorrelation play important roles in radar, communication, and cryptography. Finding new binary sequences with optimal autocorrelation has been an interesting research topic in sequence design.…

Information Theory · Computer Science 2017-07-26 Wei Su , Yang Yang , Cuiling Fan

Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been applied in stream cipher. In general, it is difficult to give both the linear complexity and…

Information Theory · Computer Science 2017-03-21 Yuhua Sun , Qiang Wang , Tongjiang Yan

In this paper, a new method is presented to compute the 2-adic complexity of pseudo-random sequences. With this method, the 2-adic complexities of all the known sequences with ideal 2-level autocorrelation are uniformly determined. Results…

Cryptography and Security · Computer Science 2013-09-09 Hai Xiong , Longjiang Qu , Chao Li

Su et al. proposed several new classes of quaternary sequences of even length with optimal autocorrelation interleaved by twin-prime sequences pairs, GMW sequences pairs or binary cyclotomic sequences of order four in \cite{S1}. In this…

Information Theory · Computer Science 2022-09-22 Xiaoyan Jing , Zhefeng Xu , Minghui Yang , Keqin Feng

In this paper, we determine the 4-adic complexity of the balanced quaternary sequences of period $2p$ and $2(2^n-1)$ with ideal autocorrelation defined by Kim et al. (ISIT, pp. 282-285, 2009) and Jang et al. (ISIT, pp. 278-281, 2009),…

Information Theory · Computer Science 2021-07-14 Minghui Yang , Shiyuan Qiang , Xiaoyan Jing , Keqin Feng , Dongdai Lin

The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The autocorrelation values of such sequences have been determined in…

Information Theory · Computer Science 2020-07-31 Minghui Yang , Keqin Feng

The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack…

Information Theory · Computer Science 2020-11-25 Shiyuan Qiang , Xiaoyan Jing , Minghui Yang

Recently, a class of binary sequences with optimal autocorrelation magnitude has been presented by Su et al. based on interleaving technique and Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., https://doi.org/10.1007/s10623-017-0398-5).…

Information Theory · Computer Science 2018-05-08 Yuhua Sun , Tongjiang Yan , Zhixiong Chen

We show that there is a very simple approach to determine the 2-adic complexity of periodic binary sequences with ideal two-level autocorrelation. This is the first main result by H. Xiong, L. Qu, and C. Li, IEEE Transactions on Information…

Information Theory · Computer Science 2014-06-17 Honggang Hu

Binary $m$-sequences are ones with the largest period $n=2^m-1$ among the binary sequences produced by linear shift registers with length $m$. They have a wide range of applications in communication since they have several desirable…

Information Theory · Computer Science 2022-12-01 Xiaoyan Jing , Aixian Zhang , Keqin Feng

A class of binary sequences with period $2p$ is constructed using generalized cyclotomic classes, and their linear complexity, minimal polynomial over ${\mathbb{F}_{{q}}}$ as well as 2-adic complexity are determined using Gauss period and…

Information Theory · Computer Science 2021-09-10 Yan Wang , Xilin Han , Weiqiong Wang , Ziling Heng

Binary sequences with lower autocorrelation values have important applications in cryptography and communications. In this paper, we present all possible parameters for binary periodical sequences with a 2-level autocorrelation values. For…

Combinatorics · Mathematics 2018-04-12 X. Niu , H. Cao , K. Feng

Generalized cyclotomic sequences of period pq have several desirable randomness properties if the two primes p and q are chosen properly. In particular,Ding deduced the exact formulas for the autocorrelation and the linear complexity of…

Information Theory · Computer Science 2016-05-18 Yuhua Sun , Yang Yan , Fei Li , Tongjiang Yan , Hui Li

Sequences with low auto-correlation property have been applied in code-division multiple access communication systems, radar and cryptography. Using the inverse Gray mapping, a quaternary sequence of even length $N$ can be obtained from two…

Information Theory · Computer Science 2017-05-17 W Su , Y Yang , Z Zhou , X Tang

Aperiodic autocorrelation is an important indicator of performance of sequences used in communications, remote sensing, and scientific instrumentation. Knowing a sequence's autocorrelation function, which reports the autocorrelation at…

Information Theory · Computer Science 2025-01-07 Daniel J. Katz , Adeebur Rahman , Michael J Ward
‹ Prev 1 2 3 10 Next ›