Related papers: Homological Error Correcting Codes and Systolic Ge…
Given a closed manifold M, we prove the upper bound of (n+d)/2 for the length of a product of systoles that can form a curvature-free lower bound for the total volume of M, in the spirit of M. Gromov's systolic inequalities. Here n is the…
We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in $\mathbb{Z}^d$. The construction must be {\em consistent} (that is, satisfy the natural extension of…
We prove an upper bound on the systolic ratio of an orientable isometric filling of the circle equipped with a Riemannian metric. The bound depends only on the genus of isometric filling. We also apply the bound to the class of orientable…
We investigate the interaction between systolic geometry and positive scalar curvature through spinorial methods. Our main theorem establishes an upper bound for the two-dimensional stable systole on certain high-dimensional manifolds with…
No power law systolic freedom is possible for the product of mod $2$ systoles of dimension $1$ and codimension $1$. This means that any closed $n$-dimensional Riemannian manifold $M$ of bounded local geometry obeys the following systolic…
PhD thesis investigating homological quantum codes derived from curved and higher dimensional geometries. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and…
The main goal of this note is to show that the study of closed hyperbolic surfaces with maximum length systole is in fact the study of surfaces with maximum length homological systole. The same result is shown to be true for once-punctured…
This is an expository essay about systolic geometry. It describes a central theorem in the subject and why the proof is difficult. Then it discusses different metaphors which suggest ways to approach the problem. The metaphors connect the…
An equidistant code is a code in the Hamming space such that two distinct codewords have the same Hamming distance. This paper investigates the bounds for equidistant codes in Hamming spaces.
We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming…
This paper establishes a novel upper bound-termed the arithmetic Singleton bound-on the Hamming distance of any simple-root constacyclic code over a finite field. The key technical ingredient is the notion of multiple equal-difference (MED)…
Symplectic capacities are invariants in symplectic geometry that are used to obstruct symplectic embeddings. From a certain symplectic capacity, the Ekeland-Hofer-Zehnder capacity, one can construct the systolic ratio, which measures the…
In 1972, Marcel Berger defined a metric invariant that captures the `size' of k-dimensional homology of a Riemannian manifold. This invariant came to be called the k-dimensional SYSTOLE. He asked if the systoles can be constrained by the…
In this article we explore the relationship between the systole and the diameter of closed hyperbolic orientable surfaces. We show that they satisfy a certain inequality, which can be used to deduce that their ratio has a (genus dependent)…
We outline the current state of knowledge regarding geometric inequalities of systolic type, and prove new results, including systolic freedom in dimension 4. Namely, every compact, orientable, smooth 4-manifold X admits metrics of…
The theory of error-correcting codes is concerned with constructing codes that optimize simultaneously transmission rate and relative minimum distance. These conflicting requirements determine an asymptotic bound, which is a continuous…
A recent result on size functions is extended to higher homology modules: the persistent homology based on a multidimensional measuring function is reduced to a 1-dimensional one. This leads to a stable distance for multidimensional…
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimal chordal distance. They stem from upper bounds for codes in products of unit spheres and projective spaces. The new bounds are asymptotically better…