Related papers: Optimal codes in the Stiefel manifold

The theory of optimal design of experiments has been traditionally developed on an Euclidean space. In this paper, new theoretical results and an algorithm for finding the optimal design of an experiment located on a Riemannian manifold are…

For semiclassical problems we establish upper bounds on the number of resonances in boxes of size $h$ along the real axis, in terms of the dimension of the set of trapped trajectories. The proof uses second microlocalization.

In graph theory, a tree is one of the more popular families of graphs with a wide range of applications in computer science as well as many other related fields. While there are several distance measures over the set of all trees, we…

In Index coding there is a single sender with multiple messages and multiple receivers each wanting a different set of messages and knowing a different set of messages a priori. The Index Coding problem is to identify the minimum number of…

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…

In this paper show that the list and bounded-distance decoding problems of certain bounds for the Reed-Solomon code are at least as hard as the discrete logarithm problem over finite fields.

We consider the problem of designing optimal linear codes (in terms of having the largest minimum distance) subject to a support constraint on the generator matrix. We show that the largest minimum distance can be achieved by a subcode of a…

In this paper, we investigate geometrical properties of the rank metric space and covering properties of rank metric codes. We first establish an analytical expression for the intersection of two balls with rank radii, and then derive an…

We prove sharp upper and lower bounds for the nodal length of Steklov eigenfunctions on real-analytic Riemannian surfaces with boundary. The argument involves frequency function methods for harmonic functions in the interior of the surface…

We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where we in…

We show that the spectral embeddings of all known triangle-free strongly regular graphs are optimal spherical codes (the new cases are $56$ points in $20$ dimensions, $50$ points in $21$ dimensions, and $77$ points in $21$ dimensions), as…

We determine the Euclidean distance degrees of the three most common manifolds arising in manifold optimization: flag, Grassmann, and Stiefel manifolds. For the Grassmannian, we will also determine the Euclidean distance degree of an…

We address the problem of computing Riemannian normal coordinates on the real, compact Stiefel manifold of orthogonal frames. The Riemannian normal coordinates are based on the so-called Riemannian exponential and the Riemannian logarithm…

Insertion-deletion codes (insdel codes for short) play an important role in synchronization error correction. The higher the minimum insdel distance, the more insdel errors the code can correct. Haeupler and Shahrasbi established the…

Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance $\rho$. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of…

Inspired by a recently formulated conjecture by Bannai et al. we investigate spherical codes which admit exactly three different distances and are spherical 5-designs. Computing and analyzing distance distributions we provide new proof of…

We use two of the most fruitful methods for constructing isospectral manifolds, the Sunada method and the torus action method, to construct manifolds whose Dirichlet-to-Neumann operators are isospectral at all frequencies. The manifolds are…

We investigate universal bounds on spherical codes and spherical designs that could be obtained using Delsarte's linear programming methods. We give a lower estimate for the LP upper bound on codes, and an upper estimate for the LP lower…

Gabidulin codes can be seen as the rank-metric equivalent of Reed-Solomon codes. It was recently proven, using subspace polynomials, that Gabidulin codes cannot be list decoded beyond the so-called Johnson radius. In another result, cyclic…

Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that…