Related papers: A Family of Binary Sequences with Optimal Correlat…
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.…
Sequences with good correlation properties are widely used in engineering applications, especially in the area of communications. Among the known sequences, cyclotomic families have the optimal autocorrelation property. In this paper, we…
If C is a binary linear code, let C^2 be the linear code spanned by intersections of pairs of codewords of C. We construct an asymptotically good family of binary linear codes such that, for C ranging in this family, the C^2 also form an…
Correlation measure of order $k$ is an important measure of randomness in binary sequences. This measure tries to look for dependence between several shifted version of a sequence. We study the relation between the correlation measure of…
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…
The Pursley-Sarwate criterion of a pair of finite complex-valued sequences measures the collective smallness of the aperiodic autocorrelations and the aperiodic crosscorrelations of the two sequences. It is known that this quantity is…
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…
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…
In the realm of modern digital communication, cryptography, and signal processing, binary sequences with a low correlation properties play a pivotal role. In the literature, considerable efforts have been dedicated to constructing good…
A line packing is optimal if its coherence is as small as possible. Most interesting examples of optimal line packings are achieving equality in some of the known lower bounds for coherence. In this paper two infinite families of real and…
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…
We investigate the behavior of optimal alignment paths for homologous (related) and independent random sequences. An alignment between two finite sequences is optimal if it corresponds to the longest common subsequence (LCS). We prove the…
We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. Roughly speaking, we show that any sequence with small correlation measure up to a sufficiently large order $k$ cannot have very small…
We introduce a construction for families of 2n-dimensional arrays with asymptotically optimal pairwise cross-correlation. These arrays are constructed using a circulant array of n-dimensional Legendre arrays. We also introduce an…
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…
The identification of binary sequences with large merit factor (small mean-squared aperiodic autocorrelation) is an old problem of complex analysis and combinatorial optimization, with practical importance in digital communications…
In this paper, we investigate PN-sequences with ideal autocorrelation property and the consequences of this property on the number of +1s and -1s and run structure of sequences. We begin by discussing and surveying about the length of…
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…
Single sequences like Legendre have high linear complexity. Known CDMA families of sequences all have low complexities. We present a new method of constructing CDMA sequence sets with the complexity of the Legendre from new frequency hop…
This paper establishes new restrictions for attainable enhanced principal rank characteristic sequences (epr-sequences). These results are then used to classify two related families of sequences that are attainable by a real symmetric…