Related papers: Non-existence of perfect binary sequences
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…
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…
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…
A Barker sequence is a binary sequence for which all nontrivial aperiodic autocorrelations are either 0, 1 or -1. The only known Barker sequences have length 2, 3, 4, 5, 7, 11 or 13. It is an old conjecture that no longer Barker sequences…
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.…
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…
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…
Low autocorrelation binary sequences (LABS) are very important for communication applications. And it is a notoriously difficult computational problem to find binary sequences with low aperiodic autocorrelations. The problem can also be…
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…
Let PCS_p^N denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a delta-function. In the 1990, Boemer and Antweiler addressed the problem of constructing such sequences. They…
The extent to which a sequence of finite length differs from a shifted version of itself is measured by its aperiodic autocorrelations. Of particular interest are sequences whose entries are 1 or -1, called binary sequences, and sequences…
We show that it is possible to algorithmically verify if a given pattern sequence is noncorrelated. As an application, we compute that there are exactly $2272$ noncorrelated binary pattern sequences of length $\leq 4$. If we restrict our…
The run vector of a binary sequence reflects the run structure of the sequence, which is given by the set of all substrings of the run length encoding. The run vector and the aperiodic autocorrelations of a binary sequence are strongly…
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…
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…
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…
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…
In this paper three Schur ring are discussed, namenly: Hamming, circulant orbists and decimated circulant orbits Schur ring. By using autocorrelation function and the run structure of binary sequences we proof the relation between this…
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.…
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…