Related papers: Orientable and negative orientable sequences
We introduce and analyze a novel class of binary operations on finite-dimensional vector spaces over a field K, defined by second-order multilinear expressions with linear shifts. These operations generate polynomials whose degree increases…
In this paper we propose an algorithm to generate binary words with no more 0's than 1's having a fixed number of 1's and avoiding the pattern $(10)^j1$ for any fixed $j \geq 1$. We will prove that this generation is exhaustive, that is,…
We predict that Bessel-like beams of arbitrary integer order can exhibit a tunable self-similar behavior (that take an invariant form under suitable stretching transformations). Specifically, by engineering the amplitude and the phase on…
Binary sequences with low odd-periodic correlation magnitudes have found important applications in communication systems. It is well known that the nega-cyclic shift and negation preserve the odd-periodic autocorrelation function (OACF)…
Spacetimes which are conformally related to reducible 1+3 spacetimes are considered. We classify these spacetimes according to the conformal algebra of the underlying reducible spacetime, giving in each case canonical expressions for the…
We consider the inverse-folding problem for RNA secondary structures: for a given (pseudo-knot-free) secondary structure find a sequence that has that structure as its ground state. If such a sequence exists, the structure is called…
We first establish a simple yet powerful necessary and sufficient condition for a binary linear code to be SO, leading to a complete characterization of singly-even codes in this family. We further derive necessary and sufficient conditions…
Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete $k$-partite graphs, which can be implemented to obtain a dynamic programming algorithm running in time…
For a prime $p\ge 5$ let $q_0,q_1,\ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}\bmod 2$ and $t_n=1$ if…
An $m$-sequence is the one of the largest period among those produced by a linear feedback shift register. It possesses several desirable features of pseudorandomness such as balance, uniform pattern distribution and ideal autocorrelation…
The merit factor problem is of practical importance to manifold domains, such as digital communications engineering, radars, system modulation, system testing, information theory, physics, chemistry. However, the merit factor problem is…
We introduce several new constructions for perfect periodic autocorrelation sequences and arrays over the unit quaternions. This paper uses both mathematical proofs and com- puter experiments to prove the (bounded) array constructions have…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
In this paper we give constructions for infinite sequences of finite non-linear locally recoverable codes $\mathcal C\subseteq \prod\limits^N_{i=1}\mathbb F_{q_i}$ over a product of finite fields arising from basis expansions in algebraic…
Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…
We develop a technique for estimating the inner eccentricity in hierarchical triple systems with well separated components. We investigate systems with initially circular and coplanar orbits and comparable masses. The technique is based on…
This paper presents a novel approach to address the constrained coding challenge of generating almost-balanced sequences. While strictly balanced sequences have been well studied in the past, the problem of designing efficient algorithms…
We perform several black-hole binary evolutions using fully nonlinear numerical relativity techniques at separations large enough that low-order post-Newtonian expansions are expected to be accurate. As a case study, we evolve an equal-mass…
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
Zero correlation zone (ZCZ) sequences and Golay complementary sequences are two kinds of sequences with different preferable correlation properties. Golay-ZCZ sequences are special kinds of complementary sequences which also possess a large…