Related papers: A Direct Construction of Cross Z-Complementary Seq…
We present a general algorithm for generating arbitrary standard complementary pairs of sequences (including binary, polyphase, M-PSK and QAM) of length 2^N using Boolean functions. The algorithm follows our earlier paraunitary algorithm,…
Several string backgrounds which arise in the AdS/CFT correspondence are described by integrable sigma-models. Their target space is always a Z(4) supercoset (a semi-symmetric superspace). Here we list all semi-symmetric cosets which have…
We propose a method for the construction of sets of variable dimension strong non-overlapping matrices basing on any strong non-overlapping set of strings.
In spin-adapted open-shell coupled cluster (CC) theory, the choice of spin-free spatial substitution operators is generally not unique. Due to an increasing linear dependence of the cluster operator (with increasing substitution level), the…
In this paper, on one hand, a class of linear codes with one or two weights is obtained. Based on these linear codes, we construct two classes of constant composition codes, which includes optimal constant composition codes depending on…
The N = 2, 4 superconformal symmetry constraints in d = 4 for four point functions of chiral primary 1/2-BPS operators are derived. The operators are described by symmetric traceless tensors of the internal R-symmetry group. A substantial…
Constant dimension codes (CDCs), as special subspace codes, have received extensive attention due to their applications in random network coding. The basic problem of CDCs is to determine the maximal possible size $A_q(n,d,\{k\})$ for given…
Zero-divisors (ZDs) derived by Cayley-Dickson Process (CDP) from N-dimensional hypercomplex numbers (N a power of 2, at least 4) can represent singularities and, as N approaches infinite, fractals -- and thereby,scale-free networks. Any…
Rate-compatible error-correcting codes (ECCs), which consist of a set of extended codes, are of practical interest in both wireless communications and data storage. In this work, we first study the lower bounds for rate-compatible ECCs,…
Spatially-coupled (SC) LDPC codes have recently emerged as an excellent choice for error correction in modern data storage and communication systems due to their outstanding performance. It has long been known that irregular graph codes…
Out-of-distribution generalization capabilities of sequence-to-sequence models can be studied from the lens of two crucial forms of generalization: length generalization -- the ability to generalize to longer sequences than ones seen during…
{\bf Abstract.} Considered is the distribution of the cross correlation between $m$-sequences of length $2^m-1$, where $m$ is even, and $m$-sequences of shorter length $2^{m/2}-1$. The infinite family of pairs of $m$-sequences with…
We study states of one- and two-dimensional spin systems that are constructed as correlators within the conformal field theory of a massless, free boson. In one dimension, these are good variational wave functions for XXZ spin chains and…
Sum-rank codes have known applications in the multishot network coding, the distributed storage and the construction of space-time codes. U. Mart\'{\i}nez-Pe\~{n}as introduced the cyclic-skew-cyclic sum-rank codes and proposed the BCH bound…
We discuss the universal behaviour of scattering cross sections in the limit of infinite rapidity separation between all produced particles, and illustrate the behaviour explicitly for the production of n jets, W+n jets, Z+n jets for…
We first prove that, in Vasiliev's theory, the zero-form charges studied in 1103.2360 and 1208.3880 are twisted open Wilson lines in the noncommutative $Z$ space. This is shown by mapping Vasiliev's higher-spin model on noncommutative…
Sequence to Sequence models struggle at compositionality and systematic generalisation even while they excel at many other tasks. We attribute this limitation to their failure to internalise constructions conventionalised form meaning…
Nested Steiner quadruple systems are designs derived from Steiner quadruple systems (SQSs) by partitioning each block into pairs. A nested SQS is completely uniform if every possible pair appears with equal multiplicity, and completely…
Distribution matching transforms independent and Bernoulli(1/2) distributed input bits into a sequence of output symbols with a desired distribution. Fixed-to-fixed length, invertible, and low complexity encoders and decoders based on…
The previous constructions of quadrature amplitude modulation (QAM) Golay complementary sequences (GCSs) were generalized as $4^q $-QAM GCSs of length $2^{m}$ by Li \textsl{et al.} (the generalized cases I-III for $q\ge 2$) in 2010 and Liu…