Related papers: Bases for Riemann--Roch spaces of linearized funct…
The minimum distance of expander codes over GF(q) is studied. A new upper bound on the minimum distance of expander codes is derived. The bound is shown to lie under the Varshamov-Gilbert (VG) bound while q >= 32. Lower bounds on the…
Several important algorithms for machine learning and data analysis use pairwise distances as input. On Riemannian manifolds these distances may be prohibitively costly to compute, in particular for large datasets. To tackle this problem,…
In this paper we present an extension of known semidefinite and linear programming upper bounds for spherical codes and consider a version of this bound for distance graphs. We apply the main result for the distance distribution of a…
This article develops a variational formulation of relativistic nature applicable to the quantum mechanics context. The main results are obtained through basic concepts on Riemannian geometry. Standards definitions such as vector fields and…
Galois self-orthogonal (SO) codes are generalizations of Euclidean and Hermitian SO codes. Algebraic geometry (AG) codes are the first known class of linear codes exceeding the Gilbert-Varshamov bound. Both of them have attracted much…
The simple interpretation of the minimum distance of a linear code obtained by De Boer and Pellikaan, and later refined by the second author, is further developed through the study of various finitely generated graded modules. We use the…
We investigate several topics of the geometry on real Cayley-Klein spaces. An important concern for us is to define a distance function on the projective space in such a way that the distance between two anisotropic subspaces of the same…
The aim of this work is to give degree formulas for the generalized Hamming weights of evaluation codes and to show lower bounds for these weights. In particular, we give degree formulas for the generalized Hamming weights of…
We extend the construction of [19] by introducing spaces of generalized tensor fields on smooth manifolds that possess optimal embedding and consistency properties with spaces of tensor distributions in the sense of L. Schwartz. We thereby…
We introduce Riemannian Lie algebroids as a generalization of Riemannian manifolds and we show that most of the classical tools and results known in Riemannian geometry can be stated in this setting. We give also some new results on the…
We provide an easy approach to the geodesic distance on the general linear group GL(n) for left-invariant Riemannian metrics which are also right-O(n)-invariant. The parametrization of geodesic curves and the global existence of length…
We introduce new yet easily accessible codes for elements of $GL_r(A)$ with $A$ the adelic ring of a (dimension one) function field over a finite field. They are linear codes, and coincide with classical algebraic geometry codes when $r=1$.…
We introduce length dilatation structures on metric spaces, tempered dilatation structures and coherent projections and explore the relations between these objects and the Radon-Nikodym property and Gamma-convergence of length functionals.…
In an earlier work, the first author and Petsche solved an energy minimization problem for local fields and used the result to obtain lower bounds on the height of algebraic numbers all whose conjugates lie in various local fields, such as…
Sectional curvature bounds are of central importance in the study of Riemannian manifolds, both in smooth differential geometry and in the generalized synthetic setting of Alexandrov spaces. Riemannian metrics along with metric spaces of…
We investigate the rudiments of Riemannian geometry on orbit spaces $M/G$ for isometric proper actions of Lie groups on Riemannian manifolds. Minimal geodesic arcs are length minimising curves in the metric space $M/G$ and they can hit…
Algebraic-geometric codes can be constructed by evaluating a certain set of functions on a set of distinct rational points of an algebraic curve. The set of functions that are evaluated is the linear space of a given divisor or,…
The locally repairable code (LRC) studied in this paper is an $[n,k]$ linear code of which the value at each coordinate can be recovered by a linear combination of at most $r$ other coordinates. The central problem in this work is to…
The computation of global radial basis function (RBF) approximations requires the solution of a linear system which, depending on the choice of RBF parameters, may be ill-conditioned. We study the stability and accuracy of approximation…
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…