相关论文: Complex spherical codes with two inner products

Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…

In this paper we show that if $p$ is a polynomial which bifurcates then the product map $(z,w)\mapsto(p(z),q(w))$ can be approximated by polynomial skew products possessing special dynamical objets called blenders. Moreover, these objets…

We show that the optimal packing of hard spheres in an infinitely long cylinder yields structures characterised by a screw symmetry. Each packing can be assembled by stacking a basic unit cell ad infinitum along the length of the cylinder…

Neural codes, represented as collections of binary strings called codewords, are used to encode neural activity. A code is called convex if its codewords are represented as an arrangement of convex open sets in Euclidean space. Previous…

After recalling the definition of codes as modules over skew polynomial rings, whose multiplication is defined by using an automorphism and a derivation, and some basic facts about them, in the first part of this paper we study some of…

We obtain, in local coordinates, the explicit form of the two-dimensional, super-integrable systems of Matveev and Shevchishin involving cubic integrals. This enables us to determine for which values of the parameters these systems are…

Let $\mathcal{H}_i$ be a finite dimensional complex Hilbert space of dimension $d_i$ associated with a finite level quantum system $A_i$ for $i = i, 1,2, ..., k$. A subspace $S \subset \mathcal{H} = \mathcal{H}_{A_{1} A_{2}... A_{k}} =…

We consider the \emph{two-dimensional range maximum query (2D-RMQ)} problem: given an array $A$ of ordered values, to pre-process it so that we can find the position of the smallest element in the sub-matrix defined by a (user-specified)…

For any compact, connected, orientable, finite-type surface with marked points other than the sphere with three marked points, we construct a finite rigid set of its arc complex: a finite simplicial subcomplex of its arc complex such that…

For self maps of the disk, it can be shown that under the right conditions one can embed a discrete iteration of the map into a continuous semigroup. In this article we extend these results to two complex variables for maps of the unit ball…

In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe…

We investigate the commutativity of global products of functions on the two-sphere from the point of view of a construction started in [RT] and named the skewed product. We complete the construction of the skewed product of functions on the…

Let $\mathcal{X}$ be a set of $(h-1)$-dimensional subspaces of $\mathrm{PG}(kh-1,q)$ with the property that every hyperplane contains at most $t$ elements of $\mathcal{X}$. We prove the upper bound $|\mathcal{X}| \leq (t-k+2)q^h + t$, and…

We study $n$-dimensional matrices with $\{0,1\}$-entries ($n$-cubes) such that all their $2$-dimensional slices are incidence matrices of symmetric designs. A known construction of these objects obtained from difference sets is generalized…

In this paper the authors introduce a new notion called the quantum wreath product, which is the algebra $B \wr_Q \mathcal{H}(d)$ produced from a given algebra $B$, a positive integer $d$, and a choice $Q=(R,S,\rho,\sigma)$ of parameters.…

The density of a code is the fraction of the coding space covered by packing balls centered around the codewords. This paper investigates the density of codes in the complex Stiefel and Grassmann manifolds equipped with the chordal…

Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right…

We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…

We provide an algebraic description for sum-rank metric codes, as quotient space of a skew polynomial ring. This approach generalizes at the same time the skew group algebra setting for rank-metric codes and the polynomial setting for codes…

The linear programming decoder will occasionally output fractional-valued sequences that do not correspond to binary codewords - such outputs are termed nontrivial pseudocodewords. Feldman et al. have demonstrated that it is precisely the…