Related papers: Optimal codes in the Stiefel manifold

In this paper we study flag codes of maximum distance. We characterize these codes in terms of, at most, two relevant constant dimension codes naturally associated to them. We do this first for general flag codes and then particularize to…

We study three types of fourth-order Steklov eigenvalue problems. For the first two of them, we derive the asymptotic expansion of their spectra on Euclidean annular domains $\mathbb{B}^n_1\setminus \overline{\mathbb{B}^n_\epsilon}$ as…

Rank-metric codes, defined as sets of matrices over a finite field with the rank distance, have gained significant attention due to their applications in network coding and connections to diverse mathematical areas. Initially studied by…

A lower bound on the minimum required code length of binary codes is obtained. The bound is obtained based on observing a close relation between the Ulam's liar game and channel coding. In fact, Spencer's optimal solution to the game is…

Several new constructions of 3-dimensional optical orthogonal codes are presented here. In each case the codes have ideal autocorrelation $\mathbf{ \lambda_a=0} $, and in all but one case a cross correlation of $ \mathbf{\lambda_c=1} $. All…

We give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the upper bound can be significantly improved on average. As a…

In this work, we present a novel approach for solving stochastic shape optimization problems. Our method is the extension of the classical stochastic gradient method to infinite-dimensional shape manifolds. We prove convergence of the…

In this work we investigate unions of lifted MRD codes of a fixed dimension and minimum distance and derive an explicit formula for the cardinality of such codes. This will then imply a lower bound on the cardinality of constant dimension…

A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov- Trifonov bound in a similar way as the Hartmann-Tzeng bound extends…

We develop a network coding technique based on flags of subspaces and a corresponding network channel model. To define error correcting codes we introduce a new distance on the flag variety, the Grassmann distance on flags and compare it to…

Binary cyclic codes have been a hot topic for many years, and significant progress has been made in the study of this types of codes. As is well known, it is hard to construct infinite families of binary cyclic codes [n, n+1/2] with good…

In this paper, we investigate the encoding circuit size of Hamming codes and Hadamard codes. To begin with, we prove the exact lower bound of circuit size required in the encoding of (punctured)~Hadamard codes and (extended)~Hamming codes.…

We consider mixed Steklov-Dirichlet eigenvalue problem on smooth bounded domains in Riemannian manifolds. Under certain symmetry assumptions on multiconnected domains in $\mathbb{R}^{n}$ with a spherical hole, we obtain isoperimetric…

We compute the degree of Stiefel manifolds, that is, the variety of orthonormal frames in a finite dimensional vector space. Our approach employs techniques from classical algebraic geometry, algebraic combinatorics, and classical invariant…

We consider many-body problems in classical mechanics where a wide range of time scales limits what can be computed. We apply the method of optimal prediction to obtain equations which are easier to solve numerically. We demonstrate by…

Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In…

Various methods have been used to obtain improvements of the Goppa lower bound for the minimum distance of an algebraic geometric code. The main methods divide into two categories and all but a few of the known bounds are special cases of…

The systole of a closed Riemannian manifold is the minimal length of a non-contractible closed loop. We give a uniform lower bound for the systole for large classes of simple arithmetic locally symmetric orbifolds. We establish new bounds…

We consider how the geometry and topology of a compact $n$-dimensional Riemannian orbifold with boundary relates to its Steklov spectrum. In two dimensions, motivated by work of A. Girouard, L. Parnovski, I. Polterovich and D. Sher in the…

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…