Related papers: Bounds on Covering Codes with the Rank Metric
In this paper, we consider the problem of building a conformal boundary, embedding a pseudo-Riamnnian manifold as an open subset of a bigger one. We get first results about conformal maximality. We also show that in dimension $\geq 3$,…
We study local convexity properties of the triangular ratio metric balls in proper subdomains of the real coordinate space. We also study inclusion properties of the visual angle metric balls and related hyperbolic type metric balls in the…
This paper contributes to the study of rank-metric codes from an algebraic and combinatorial point of view. We introduce $q$-polymatroids, the $q$-analogue of polymatroids, and develop their basic properties. We associate a pair of…
Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated $q$-system. Using this result, we…
We study linear codes over Gaussian integers equipped with the Mannheim distance. We develop Mannheim-metric analogues of several classical bounds. We derive an explicit formula for the volume of Mannheim balls, which yields a sphere…
Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…
In this work we develop a geometric approach to the study of rank metric codes. Using this method, we introduce a simpler definition for generalized rank weight of linear codes. We give a complete classification of constant rank weight code…
In this note we provide several lower bounds for the volume of a geodesic ball within the injectivity radius in a $3$-dimensional Riemannian manifold assuming only upper bounds for the Ricci curvature.
Upper bounds are obtained for the $p$-capacity of compact sets in $\R^d$, with $d \ge 2$ and $1<p<d$. Upper and lower bounds are obtained for the product of $p$-capacity and powers of the $q$-torsional rigidity over the collection of all…
We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the…
We investigate the maximum cardinality and the mathematical structure of error-correcting codes endowed with the Kendall-$\tau$ metric. We establish an averaging bound for the cardinality of a code with prescribed minimum distance, discuss…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…
Motivated by problems in algebraic complexity theory (e.g., matrix multiplication) and extremal combinatorics (e.g., the cap set problem and the sunflower problem), we introduce the geometric rank as a new tool in the study of tensors and…
In this work we present a new criterion to check if a given rank-metric code is a maximum rank distance (MRD) code. Moreover, we derive a criterion to check if a given MRD code is a generalized Gabidulin code. We then use these results to…
We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…
Lattice coverings in the real plane by Minkowski balls are studied. We exploit the duality of admissible lattices of Minkowski balls and inscribed convex symmetric hexagons of these balls. An explicit moduli space of the areas of these…
We introduce the class of rank-metric geometric lattices and initiate the study of their structural properties. Rank-metric lattices can be seen as the $q$-analogues of higher-weight Dowling lattices, defined by Dowling himself in 1971. We…
It is well known that a spherically symmetric compact star whose energy density decreases monotonically possesses an upper bound on its mass-to-radius ratio, $2M/R\leq 8/9$. However, field configurations typically will not be compact. Here…