Related papers: Optimal codes in the Stiefel manifold
Subspace codes form the appropriate mathematical setting for investigating the Koetter-Kschischang model of fault-tolerant network coding. The Main Problem of Subspace Coding asks for the determination of a subspace code of maximum size…
We determine a nice simple formula for the largest Euclidean space for which there is an orientable n-manifold with a nonimmersion detected by Stiefel-Whitney classes. For Spin manifolds, we prove the analogue of the upper bound and…
We introduce Reed-Solomon-Gabidulin codes which is, at the same time, an extension to Reed-Solomon codes on the one hand and Gabidulin codes on the other hand. We prove that our codes have good properties with respect to the minimal…
In this note, we find a sharp upper bound for the Steklov spectrum on a submanifold of revolution in Euclidean space with one boundary component.
Locally repairable codes which are optimal with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known…
A flag is a sequence of nested subspaces of a given ambient space F_q^n over a finite field F_q. In network coding, a flag code is a set of flags, all of them with the same sequence of dimensions, the type vector. In this paper, we…
Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. We study basic coding theoretic problems for such codes, representing them as subsets of the set of permutations of $n$…
Universal bounds for the potential energy of weighted spherical codes are obtained by linear programming. The universality is in the sense of Cohn-Kumar -- every attaining code is optimal with respect to a large class of potential functions…
We propose a method for computing upper bounds for the Heilbronn problem for triangles.
We establish Strichartz estimates for the Schr\"odinger equation on Riemannian manifolds $(\Omega,\g)$ with boundary, for both the compact case and the case that $\Omega$ is the exterior of a smooth, non-trapping obstacle in Euclidean…
Consider the problem of minimizing a quadratic objective subject to quadratic equations. We study the semialgebraic region of objective functions for which this problem is solved by its semidefinite relaxation. For the Euclidean distance…
We compute the cohomology of the right generalised projective Stiefel manifolds and use it to find bounds on the rank of the complementary bundle for certain vector bundles. Further the cohomology computations are also used to find bounds…
We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…
In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of…
We study the asymptotic Dirichlet problem for A-harmonic equations and for the minimal graph equation on a Cartan-Hadamard manifold M whose sectional curvatures are bounded from below and above by certain functions depending on the distance…
Error-correcting codes resilient to synchronization errors such as insertions and deletions are known as insdel codes. Due to their important applications in DNA storage and computational biology, insdel codes have recently become a focal…
A fundamental problem in quantum coding theory is to determine the maximum size of quantum codes of given block length and distance. A recent work introduced bounds based on semidefinite programming, strengthening the well-known quantum…
Cyclic codes are an important class of linear codes. Bounding the minimum distance of cyclic codes is a long-standing research topic in coding theory, and several well-known and basic results have been developed on this topic. Recently,…
In this paper an interpolation-based decoding algorithm to decode Gabidulin codes, transmitted through a finely restricted channel, is proposed. The algorithm is able to decode rank errors beyond half the minimum distance by one unit. Also…
Local operations and classical communication (LOCC) is a foundational framework in quantum information from both theoretical and experimental perspectives. However, designing and optimizing LOCC protocols is intractable due to their complex…