English
Related papers

Related papers: The 2-adic complexity of Yu-Gong sequences with in…

200 papers

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 periodic sequences with good autocorrelation property have many applications in many aspects of communication. In past decades many series of such binary sequences have been constructed. In the application of cryptography, such…

Information Theory · Computer Science 2021-05-31 Qiuyue Liu , Shiyuan Qiang , Minghui Yang , Keqin Feng

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

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

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

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

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

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

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

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

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

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

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

Recently, Jiang et al. proposed several new classes of quaternary sequences with low autocorrelation and high linear complexity by using the inverse Gray mapping (JAMC, \textbf{69} (2023): 689--706). In this paper, we estimate the 4-adic…

Cryptography and Security · Computer Science 2024-01-09 Feifei Yan , Pinhui Ke , Lingmei Xiao

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

The $2$-adic complexity has been well-analyzed in the periodic case. However, we are not aware of any theoretical results on the $N$th $2$-adic complexity of any promising candidate for a pseudorandom sequence of finite length $N$ or…

Information Theory · Computer Science 2023-09-25 Zhiru Chen , Zhixiong Chen , Jakob Obrovsky , Arne Winterhof

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

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

We examine the linear complexity and the autocorrelation properties of new quaternary cyclotomic sequences of period 2p. The sequences are constructed via the cyclotomic classes of order four.

Information Theory · Computer Science 2013-05-17 Vladimir Edemskiy , Andrew Ivanov

Let $p$ be an odd prime such that $p \equiv 3\;{\rm mod}\;4$ and $n$ be an odd integer. In this paper, two new families of $p$-ary sequences of period $N = \frac{p^n-1}{2}$ are constructed by two decimated $p$-ary m-sequences $m(2t)$ and…

Information Theory · Computer Science 2013-10-11 Wijik Lee , Ji-Youp Kim , Jong-Seon No
‹ Prev 1 2 3 10 Next ›