Related papers: New Constructions of Complementary Sequence Pairs …
In this study, we propose a flexible construction of complementary sequences (CSs) that can contain zero-valued elements. To derive the construction, we use Boolean functions to represent a polynomial generated with a recursion. By applying…
In this paper, the linear complexity over $\mathbf{GF}(r)$ of generalized cyclotomic quaternary sequences with period $2pq$ is determined, where $ r $ is an odd prime such that $r \ge 5$ and $r\notin \lbrace p,q\rbrace$. The minimal value…
We present a new construction of ordered orthogonal arrays (OOA) of strength $t$ with $(q + 1)t$ columns over a finite field $\mathbb{F}_{q}$ using linear feedback shift register sequences (LFSRs). OOAs are naturally related to $(t, m,…
On conformal manifolds of even dimension $n\geq 4$ we construct a family of new conformally invariant differential complexes. Each bundle in each of these complexes appears either in the de Rham complex or in its dual. Each of the new…
This letter presents a direct construction of cross Z-complementary sequence sets (CZCSSs), whose aperiodic correlation sums exhibit zero correlation zones at both the front-end and tail-end shifts. CZCSS can be regarded as an extension of…
Entanglement-assisted quantum error correcting codes (EAQECCs) can be derived from arbitrary classical linear codes. However, it is a very difficult task to determine the number of entangled states required. In this work, using the method…
We extend the theory of regularity structures [Hai14] to allow processes belonging to locally $m$-convex topological algebras. This extension includes processes in the locally $C^{*}$-algebras of [CHP25] used to localise singular stochastic…
In this paper, preamble-based least squares (LS) channel estimation in OFDM systems of the QAM and offset QAM (OQAM) types is considered, in both the frequency and the time domains. The construction of optimal (in the mean squared error…
Mutually orthogonal complementary sets (MOCSs) have received significant research attention in recent years due to their wide applications in communications and radar. Existing MOCSs which are constructed based on generalized Boolean…
A $pseudo$-$oval$ of a finite projective space over a finite field of odd order $q$ is a configuration of equidimensional subspaces that is essentially equivalent to a translation generalised quadrangle of order $(q^n,q^n)$ and a Laguerre…
In this paper, a new four-dimensional 64-ary polarization ring switching (4D-64PRS) modulation format with a spectral efficiency of 6 bit/4D-sym is introduced. The format is designed by maximizing the generalized mutual information (GMI)…
By applying Chinese remainder theorem for coprime polynomials and the "creative microscoping" method recently introduced by the author and Zudilin, we establish parametric generalizations of three $q$-supercongruences modulo the fourth…
Let $(A,\mathfrak{m})$ be a hypersurface ring with dimension $d$, and $M$ a MCM $A-$module with red$(M)\leq 2$ and $\mu(M)=2$ or $3$ then we have proved that depth $G(M)\geq d-\mu(M)+1$. If $e(A)=3$ and $\mu(M)=4$ then in this case we have…
The construction of quantum error-correcting codes (QECCs) with good parameters is a hot topic in the area of quantum information and quantum computing. Quantum maximum distance separable (QMDS) codes are optimal because the minimum…
This paper presents four new classes of binary quantum codes with minimum dis- tance 3 and 4, namely Class-I, Class-II, Class-III and Class-IV. The classes Class-I and Class-II are constructed based on self-dual orientable embeddings of the…
Optical continuous-variable cluster states (CVCSs) in combination with Gottesman-Kitaev-Preskill~(GKP) qubits enable fault-tolerant quantum computation so long as these resources are of high enough quality. Previous studies concluded that a…
We propose two types, namely Type-I and Type-II, quantum stabilizer codes using quadratic residue sets of prime modulus given by the form $p=4n\pm1$. The proposed Type-I stabilizer codes are of cyclic structure and code length $N=p$. They…
The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…
Following an earlier proposal arXiv:2307.02038 to apply the GLSM formalism to understand the so-called non-commutative resolution, this paper takes one important step further to extend this formalism to a much larger class of…
We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane…