Related papers: New Optimal Binary Sequences with Period $4p$ via …
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…
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…
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…
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…
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…
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…
A general construction of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic and this construction, several classes of binary sequences with optimal autocorrelation and other…
Constructions of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic, several more general constructions of binary sequences with optimal autocorrelations and other low…
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).…
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.
In this work, a classical problem of the digital sequence design, or more precisely, finding binary sequences with optimal peak sidelobe level (PSL), is revisited. By combining some of our previous works, together with some mathematical…
Sequences with good randomness properties are quite important for stream ciphers. In this paper, a new class of quaternary sequences is constructed by using generalized cyclotomic classes of $\mathbb{Z}_{2p^m}$ $(m\geq1)$. The exact values…
This paper proposes a new class of random sequences called binary primes tableau (PT) sequences that have potential applications in cryptography and communications. The PT sequence of rank p is obtained from numbers arranged in a tableau…
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…
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…
We investigate the $k$-error linear complexity over $\mathbb{F}_p$ of binary sequences of length $2p$ with optimal three-level autocorrelation. These balanced sequences are constructed by cyclotomic classes of order four using a method…
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),…
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.…
Binary sequences with minimal autocorrelations have applications in communication engineering, mathematics and computer science. In statistical physics they appear as groundstates of the Bernasconi model. Finding these sequences is a…
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…