Related papers: MacWilliams' Extension Theorem for rank-metric cod…
A MacWilliams Identity for convolutional codes will be established. It makes use of the weight adjacency matrices of the code and its dual, based on state space realizations (the controller canonical form) of the codes in question. The…
The number-theoretic codes are a class of codes defined by single or multiple congruences and are mainly used for correcting insertion and deletion errors. Since the number-theoretic codes are generally non-linear, the analysis method for…
Let $F$ be a finite field. A multiset $S$ of integers is projection-forcing if for every linear function $\phi : F^n \to F^m$ whose multiset of weight changes is $S$, $\phi$ is a coordinate projection up to permutation and scaling of…
We consider generalized metric spaces taking distances in an arbitrary ordered commutative monoid, and investigate when a class $\mathcal{K}$ of finite generalized metric spaces satisfies the Hrushovski extension property: for any…
We present the theory of linear rank-metric codes from the point of view of their fundamental parameters. These are: the minimum rank distance, the rank distribution, the maximum rank, the covering radius, and the field size. The focus of…
A class of linear block codes which simultaneously generalizes Gabidulin codes and a class of skew cyclic codes is defined. For these codes, both a Hartmann-Tzeng-like bound and a Roos-like bound, with respect to their rank distance, are…
We give Ramsey expansions of classes of generalised metric spaces where distances come from a linearly ordered commutative monoid. This complements results of Conant about the extension property for partial automorphisms and extends an…
We show that every cross ratio preserving homeomorphism between boundaries of Hadamard manifolds extends to a continuous map, called circumcenter extension, provided that the manifolds satisfy certain visibility conditions. We show that…
The classical Stein--Tomas theorem extends the theory of linear Fourier restriction estimates from smooth manifolds to fractal measures exhibiting Fourier decay. In the multilinear setting, transversality allows for Fourier extension…
With the discovery of Dark Energy, $\Lambda_{DE}$, there is now a universal length scale, $\ell_{DE}=c/(\Lambda_{DE} G)^{1/2}$, associated with the universe that allows for an extension of the geodesic equations of motion. In this paper, we…
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…
Linear sets over finite fields are central objects in finite geometry and coding theory, with deep connections to structures such as semifields, blocking sets, KM-arcs, and rank-metric codes. Among them, $i$-clubs, a class of linear sets…
We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes, viewed as a sheaf of vector spaces on a finite topological space we call coded space. Many existing codes, such as tensor product codes,…
This paper introduces new constructions of sum-rank metric codes derived from algebraic function fields, as existing results on such codes remain limited. A major challenge lies in the determination of their parameters. We address this…
An algebraic extension K of the rationals has the Bogomolov property if the absolute logarithmic height of non-torsion points of K* is bounded away from 0. We define a relative extension L/K to be Bogomolov if this holds for points of L\K.…
A theorem by Mumford implies that every automorphic line bundle on a pure open Shimura variety, equipped with an invariant smooth metric, can be uniquely extended as a line bundle on a toroidal compactification of the variety, in such a way…
This paper generalises the result of Jean-Pierre Demailly on his Ohsawa--Takegoshi-type $L^2$ extension theorem, which guarantees holomorphic extensions for some sections $f$ on analytic subspaces $Y$ defined by multiplier ideal sheaves of…
Linear programming approaches have been applied to derive upper bounds on the size of classical codes and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance, including nonadditive…
One-weight codes, in which all nonzero codewords share the same weight, form a highly structured class of linear codes with deep connections to finite geometry. While their classification is well understood in the Hamming and rank metrics -…
The rigidity matrix is a fundamental tool for studying the infinitesimal rigidity properties of Euclidean bar-joint frameworks. In this paper we generalize this tool and introduce a rigidity matrix for bar-joint frameworks in arbitrary…