Related papers: MacWilliams' Extension Theorem for rank-metric cod…
Symmetric ideals in increasingly larger polynomial rings that form an ascending chain are investigated. We focus on the asymptotic behavior of codimensions and projective dimensions of ideals in such a chain. If the ideals are graded it is…
We study the Hermitian hull-variation problem for vector rank-metric codes. Except for one parameter pair, we show that the Hermitian hull dimension of such a code can be reduced to any smaller value within its equivalence class, and in…
Formal analogies between gravitational and optical phenomena have been explored for over a century, providing valuable insights into kinematic aspects of general relativity. Here, this analogy is employed to study light propagation in…
A characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold over other characteristics. In this…
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to show, interpreting the following notions appropriately, that if…
We prove that a random linear code over F_q, with probability arbitrarily close to 1, is list decodable at radius (1-1/q-\epsilon) with list size L=O(1/\epsilon^2) and rate R=\Omega_q(\epsilon^2/(log^3(1/\epsilon))). Up to the…
Let $E \subseteq \mathbb{R}^n$ be a union of line segments and $F \subseteq \mathbb{R}^n$ the set obtained from $E$ by extending each line segment in $E$ to a full line. Keleti's line segment extension conjecture posits that the Hausdorff…
We consider the Fleming--Viot particle system associated with a continuous-time Markov chain in a finite space. Assuming irreducibility, it is known that the particle system possesses a unique stationary distribution, under which its…
We prove that the derived direct image of the constant sheaf with field coefficients under any proper map with smooth source contains a canonical summand. This summand, which we call the geometric extension, only depends on the generic…
The study of linear codes over a finite field of odd cardinality, derived from determinantal varieties obtained from symmetric matrices of bounded rank, was initiated in a recent paper by the authors. There, one found the minimum distance…
A subspace of matrices over $\mathbb{F}_{q^e}^{m\times n}$ can be naturally embedded as a subspace of matrices in $\mathbb{F}_q^{em\times en}$ with the property that the rank of any of its matrix is a multiple of $e$. It is quite natural to…
A complete extension theorem for linear codes over a module alphabet and the symmetrized weight composition is proved. It is shown that an extension property with respect to arbitrary weight function does not hold for module alphabets with…
In this paper we consider the rigidity and flexibility of $C^{1, \theta}$ isometric extensions and we show that the H\"older exponent $\theta_0=\frac12$ is critical in the following sense: if $u\in C^{1,\theta}$ is an isometric extension of…
We investigate the asymptotic density of error-correcting codes with good distance properties and prescribed linearity degree, including sublinear and nonlinear codes. We focus on the general setting of finite translation-invariant metric…
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…
We prove the Ramsey property for classes of ordered structures with closures and given local properties. This generalises earlier results: the Ne\v{s}et\v{r}il-R\"odl Theorem, the Ramsey property of partial orders and metric spaces as well…
In this paper, we consider boundary extensions of two classes of mappings between metric measure spaces. These two mapping classes extend in particular the well-studied geometric mappings such as quasiregular mappings with integrable…
We consider extensions of the Rattray theorem and two Makeev's theorems, showing that they hold for several maps, measures, or functions simultaneously, when we consider orthonormal $k$-frames in $\R^n$ instead of orthonormal basis (full…
An index coding (IC) problem consisting of a server and multiple receivers with different side-information and demand sets can be equivalently represented using a fitting matrix. A scalar linear index code to a given IC problem is a matrix…
The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…