Related papers: A Construction for Perfect Periodic Autocorrelatio…
In this paper, we determine the 4-adic complexity of the balanced quaternary sequences of period $2p$ and $2(2^n-1)$ with ideal autocorrelation defined by Kim et al. (ISIT, pp. 282-285, 2009) and Jang et al. (ISIT, pp. 278-281, 2009),…
In this paper we provide a unified combinatorial approach to establish a connection between Stirling permutations, cycle structures of permutations and perfect matchings. The main tool of our investigations is MY-sequences. In particular,…
In this paper, we shall find a new connection between $n$th degree polynomial mod $p$ congruence with $n$ roots and higher-order Fibonacci and Lucas sequences. We shall first discuss the recent work been done in sequences and their…
For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…
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…
This paper presents a class of random orthogonal sequences associated with the number theoretic Hilbert transform. We present a constructive procedure for finding the random sequences for different modulus values. These random sequences…
Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences of period $4p$ with optimal autocorrelation magnitude was constructed in \cite{W. Su}. Later, Fan showed that the linear complexity of this class of sequences is…
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…
Generalized cyclotomic sequences of period pq have several desirable randomness properties if the two primes p and q are chosen properly. In particular,Ding deduced the exact formulas for the autocorrelation and the linear complexity of…
For over three decades, the pursuit of perfect periodic autocorrelation sequences has been constrained by Mow's conjecture, which posits that no perfect sequence over an $n$-phase alphabet can exist with a length greater than $n^2$. While a…
We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…
We consider the class of Rudin-Shapiro-like polynomials, whose $L^4$ norms on the complex unit circle were studied by Borwein and Mossinghoff. The polynomial $f(z)=f_0+f_1 z + \cdots + f_d z^d$ is identified with the sequence…
The paper studies different variants of almost periodicity notion. We introduce the class of eventually strongly almost periodic sequences where some suffix is strongly almost periodic (=uniformly recurrent). The class of almost periodic…
We find closed formulas for arbitrarily high mixed moments of characteristic polynomials of the Alternative Circular Unitary Ensemble (ACUE), as well as closed formulas for the averages of ratios of characteristic polynomials in this…
Constant amplitude zero autocorrelation (CAZAC) sequences have modulus one and ideal periodic autocorrelation function. Such sequences are used in cellular radio communications systems, e.g., for reference signals, synchronization signals…
Classical studies of the Fibonacci sequence focus on its periodicity modulo $m$ (the Pisano periods) with canonical initialization. We investigate instead the complete periodic structure arising from all $m^2$ possible initializations in…
A perfect structure is a triple $(M,P,S)$ of matrices $M, P$ and $S$ of consistent sizes such that $MP = PS$. Perfect structures comprise similar matrices, eigenvectors, perfect colorings (equitable partitions) and graph coverings. In this…
Sequences with low auto-correlation property have been applied in code-division multiple access communication systems, radar and cryptography. Using the inverse Gray mapping, a quaternary sequence of even length $N$ can be obtained from two…
We extend the paraunitary (PU) theory for complementary pairs to comple- mentary sets and complete complementary codes (CCC) by proposing a new PU construction. A special, but very important case of complementary sets (and CC- C), based on…
In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result…