Related papers: Arithmetic Autocorrelation of Binary $m$-Sequences
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…
LSB (Least Significant Bit) sequences are widely used as the initial inputs in some modern stream ciphers, such as the ZUC algorithm-the core of the 3GPP LTE International Encryption Standard. Therefore, analyzing the statistical properties…
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…
Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro sequence, have some desirable features of pseudorandomness such as a large linear complexity and a small well-distribution measure. However, they also have some…
Binary self-dual sequences have been considered and analyzed throughout the years, and they have been used for various applications. Motivated by a construction for single-track Gray codes, we examine the structure and recursive…
We consider a binary sequence generated by thresholding a hidden continuous sequence. The hidden variables are assumed to have a compound symmetry covariance structure with a single parameter characterizing the common correlation. We study…
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).…
A pseudorandom number generator is widely used in cryptography. A cryptographic pseudorandom number generator is required to generate pseudorandom numbers which have good statistical properties as well as unpredictability. An m-sequence is…
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, we design low correlation binary sequences favorable in wireless communication and radar applications. First, we formulate the designing problem as a nonconvex combination optimization problem with flexible correlation…
It is shown that a random binary process with impulse-like autocorrelation can be generated by randomizing the length of symbols occurring in a random Bernoulli process. Such randomization is achieved by random (or judiciously designed…
In this paper, we present a computational search for best-known merit factors of longer binary sequences with an odd length. Finding low autocorrelation binary sequences with optimal or suboptimal merit factors is a very difficult…
In this paper, we present an alternative proof showing that the maximal aperiodic autocorrelation of the $m$-th Rudin-Shapiro sequence is of the same order as $\lambda^{m}$, where $\lambda$ is the real root of $x^{3} + x^{2} - 2x - 4$. This…
The merit factor of a $\{-1, 1\}$ binary sequence measures the collective smallness of its non-trivial aperiodic autocorrelations. Binary sequences with large merit factor are important in digital communications because they allow the…
Consider words of length $n$. The set of all periods of a word of length $n$ is a subset of $\{0,1,2,\ldots,n-1\}$. However, any subset of $\{0,1,2,\ldots,n-1\}$ is not necessarily a valid set of periods. In a seminal paper in 1981, Guibas…
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…
This paper studies simultaneous inference of conditional distributions in nonlinear time series from a sieve M-regression perspective. Existing literature on sieve M-regression has primarily focused on pointwise asymptotics, leaving the…
The autocorrelation function and the run structure are two basic notions for binary sequences, and have been used as two independent postulates to test randomness of binary sequences ever since Golomb 1955. In this paper, we prove for…
The asymptotic behavior of estimates and information criteria in linear models are studied in the context of hierarchically correlated sampling units. The work is motivated by biological data collected on species where autocorrelation is…
The correlation measure is a testimony of the pseudorandomness of a sequence $\infw{s}$ and provides information about the independence of some parts of $\infw{s}$ and their shifts. Combined with the well-distribution measure, a sequence…