Related papers: Arithmetic crosscorrelation of binary $m$-sequence…
Measuring the topological overlap of two graphs becomes important when assessing the changes between temporally adjacent graphs in a time-evolving network. Current methods depend on the fraction of nodes that have persisting edges. This…
In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…
The linear complexity and the $k$-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By studying the linear complexity of binary…
This paper presents a twist to the generation of binary random sequences by starting with decimal sequences. Rather than representing the prime reciprocal sequence directly in base 2, we first right the prime reciprocal in base 10 and then…
In this work we investigate codes in $\mathbb{Z}_{2^m}^n$ that can correct errors that occur in just one coordinate of the codeword, with a magnitude of up to a given parameter $t$. We will show upper bounds on these cross codes, derive…
To find the non-standard binary Golay complementary sequences (GCSs) of length $2^{m}$ or theoretically prove the nonexistence of them are still open. Since it has been shown that all the standard $q$-ary (where $q$ is even) GCSs of length…
Completely antipersistent binary time series are sequences in which every time that an $N$-bit string $\mu$ appears, the sequence is continued with a different bit than at the last occurrence of $\mu$. This dynamics is phrased in terms of a…
Gyarmati, Mauduit and S\'ark\"ozy introduced the cross-correlation measure $\Phi_k(G)$ of order $k$ to measure the level of pseudorandom properties of families of finite binary sequences. In an earlier paper we estimated the…
A sequence of bifurcations is studied in a one-dimensional pattern forming system subject to the variation of two experimental control parameters: a dimensionless electrical forcing number ${\cal R}$ and a shear Reynolds number ${\rm Re}$.…
We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…
The sum-product algorithm for decoding of binary codes is analyzed for bipartite graphs in which the check nodes all have degree $2$. The algorithm simplifies dramatically and may be expressed using linear algebra. Exact results about the…
Applying a method of Godsil and McKay \cite{GM} to some graphs related to the symplectic graph, a series of new infinite families of strongly regular graphs with parameters…
We consider the problem of determining the cross-correlation values of the sequences in the families comprised of constant multiples of $M$-ary Sidelnikov sequences over $\mathbb{F}_q$, where $q$ is a power of an odd prime $p$. We show that…
Let k_r(n,m) denote the minimum number of r-cliques in graphs with n vertices and m edges. For r=3,4 we give a lower bound on k_r(n,m) that approximates k_r(n,m) with an error smaller than n^r/(n^2-2m). The solution is based on a constraint…
We consider algebras of $m\times m\times m$-cubic matrices (with $m=1,2,\dots$). Since there are several kinds of multiplications of cubic matrices, one has to specify a multiplication first and then define an algebra of cubic matrices…
The study of optical orthogonal codes has been motivated by an application in an optical code-division multiple access system. This paper focuses on optimal two-dimensional optical orthogonal codes with autocorrelation and cross-correlation…
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…
For the set of graphs with a given degree sequence, consisting of any number of $2's$ and $1's$, and its subset of bipartite graphs, we characterize the optimal graphs who maximize and minimize the number of $m$-matchings. We find the…
A binary triangle of size $n$ is a triangle of zeroes and ones, with $n$ rows, built with the same local rule as the standard Pascal triangle modulo $2$. A binary triangle is said to be balanced if the absolute difference between the…
Sequences with a low correlation have very important applications in communications, cryptography, and compressed sensing. In the literature, many efforts have been made to construct good sequences with various lengths where binary…