Related papers: Partial direct product difference sets and sequenc…
Motivated by the known autocorrelation properties of the Rudin-Shapiro sequence, we study the discrete correlation among infinite sequences over a finite alphabet, where we just take into account whether two symbols are identical. We show…
In this paper we study pseudorandomness of a family of sequences in terms of two measures, the family complexity ($f$-complexity) and the cross-correlation measure of order $\ell$. We consider sequences not only on binary alphabet but also…
In this article we introduce a class of discontinuous almost automorphic functions which appears naturally in the study of almost automorphic solutions of differential equations with piecewise constant argument. Their fundamental properties…
We examine the linear complexity and the autocorrelation properties of new quaternary cyclotomic sequences of period 2p. The sequences are constructed via the cyclotomic classes of order four.
In this paper, we describe the automorphism group of semidirect product of two groups that fixes the non-normal subgroup of it. We have computed these automorphisms for the non-abelian metacyclic $p$-group and non-abelian $p$-groups $(p\ge…
Spread spectrum multiple access systems demand minimum possible cross-correlation between the sequences within a set of sequences having good auto-correlation properties. Through a connection between generalised Frank sequences and…
In this paper, we introduce a flip operation on self-complementary ideals of chain product posets and study the resulting flip graphs. We give asymptotics for the number of vertices in these graphs, compute their diameters, and give bounds…
Let $R$ be a (P.I.D) and let $T(V),\partial)$ be a free $R$-dga. The quasi-isomorphism type of $(T(V),\partial)$ is the set, denoted $\{(T(V),\partial)\}$, of all free dgas which are quasi-isomorphic to $(T(V),\partial)$. In this paper we…
Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…
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…
We introduce a construction for perfect periodic autocorrelation sequences over roots of unity. The sequences share similarities to the perfect periodic sequence constructions of Liu, Frank, and Milewski.
Using a special metric in the space of sequences, we give a geometric description of almost periodic sets in the $k$-dimensional Euclidean space. We prove the completeness of the space of almost periodic sets and some analogue of the…
Pseudo-random arrays and perfect maps are the two-dimensional analogs of M-sequences and de Bruijn sequences, respectively. We modify the definitions to be applied to codes. These codes are also the two-dimensional analogs of certain…
The concept of a sequence of exact zero-divisors on a noetherian local ring is defined and studied. Some properties of sequences of exact zero-divisors are compared with regular sequences.
Aperiodic order refers to the mathematical formalisation of quasicrystals. Substitutions and cut and project sets are among their main actors; they also play a key role in the study of dynamical systems, whether they are symbolic, generated…
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 study the algebraic dynamics of self-correspondences on a curve. A self-correspondence on a (proper and smooth) curve $C$ over an algebraically closed field is the data of another curve $D$ and two non-constant separable morphisms…
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…
Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. The contribution of this work is two-fold. First,…
In this paper, we investigate the ideals of semidirect products of L-algebras and the structure of simple L-algebras. We provide a precise characterization of the ideals of semidirect products and describe the structure of their prime…