Related papers: Homological Error Correcting Codes and Systolic Ge…
The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…
The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum…
We derive global estimates for the error in solutions of linear hyperbolic systems due to inaccurate boundary geometry. We show that the error is bounded by data and bounded in time when the solutions in the true and approximate domains are…
In this article, we prove that finite (weakly) systolic and Helly complexes can be reconstructed from their boundary distances (computed in their 1-skeleta). Furthermore, Helly complexes and 2-dimensional systolic complexes can be…
We study the asymptotic behaviour of 1-parameter subgroups with respect to Hofer's metric when the underlying symplectic manifold is an open surface of infinite area. We prove that, depending on the topology of the level sets of the…
We show that the existence of a nontrivial Massey product in the cohomology ring H^*(X) imposes global constraints upon the Riemannian geometry of a manifold X. Namely, we exhibit a suitable systolic inequality, associated to such a…
Inspired by the classical Riemannian systolic inequality of Gromov we present a combinatorial analogue providing a lower bound on the number of vertices of a simplicial complex in terms of its edge-path systole. Similarly to the Riemannian…
In this work the spontaneous symmetry breaking in certain nonlinear theories with second-class constraints is explored. Using the Dirac's method we perform an analysis of the constraints and the counting of the degrees of freedom. The…
The asymptotic rate vs. distance problem is a long-standing fundamental problem in coding theory. The best upper bound to date was given in 1977 and has received since then numerous proofs and interpretations. Here we provide a new,…
Coboundary and cosystolic expansion are notions of expansion that generalize the Cheeger constant or edge expansion of a graph to higher dimensions. The classical Cheeger inequality implies that for graphs edge expansion is equivalent to…
The results of this paper have been greatly superseded by those in the paper "Contact geometry and isosystolic inequalities" (arXiv:1109.4253) by the same authors.
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…
In the abstract of [1] we read: "We obtain so far unproved properties of a ratio involving a classof Hermite and parabolic cylinder functions." However, we explain how some of the main results in that paper were already proved in [2],…
In this paper, we study graph distances in the geometric random graph models scale-free percolation SFP, geometric inhomogeneous random graphs GIRG, and hyperbolic random graphs HRG. Despite the wide success of the models, the parameter…
For a code $C$ in a space with maximal distance $n$, we say that $C$ has symmetric distances if its distance set $S(C)$ is symmetric with respect to $n / 2$. In this paper, we prove that if $C$ is a binary code with length $2n$, constant…
We apply a local systolic-diastolic inequality for contact forms and odd-symplectic forms on three-manifolds to bound the magnetic length of closed curves with prescribed geodesic curvature (also known as magnetic geodesics) on an oriented…
In this paper asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protograph-based LDPC convolutional codes. In particular, we show that the…
In Thurston's notes, he gives two different definitions of the Gromov norm (also called simplicial volume) of a manifold and states that they are equal but does not prove it. Gromov proves it in the special case of hyperbolic manifolds as a…
We study the classical expander codes, introduced by Sipser and Spielman \cite{SS96}. Given any constants $0< \alpha, \varepsilon < 1/2$, and an arbitrary bipartite graph with $N$ vertices on the left, $M < N$ vertices on the right, and…
In contact geometry, a systolic inequality is a uniform upper bound on the shortest period of a closed Reeb orbit, in terms of the contact volume. We prove a general systolic inequality valid on Seifert bundles with non-zero Euler number…