Related papers: Perfect Codes for Generalized Deletions from Minus…
In a recent paper, Brakensiek, Gopi and Makam introduced higher order MDS codes as a generalization of MDS codes. An order-$\ell$ MDS code, denoted by $\operatorname{MDS}(\ell)$, has the property that any $\ell$ subspaces formed from…
The aim of this article is to provide space level maps between configuration spaces of graphs that are predicted by algebraic manipulations of cellular chains. More explicitly, we consider edge contraction and half-edge deletion, and…
We investigate the representations of the hyperalgebras associated to the map algebras $\mathfrak g\otimes \mathcal A$, where $\mathfrak g$ is any finite-dimensional complex simple Lie algebra and $\mathcal A$ is any associative commutative…
A theory of cyclic elements in semisimple Lie algebras is developed. It is applied to an explicit construction of regular elements in Weyl groups.
We improve the upper bound of Levenshtein for the cardinality of a code of length 4 capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we will construct an…
The parameters of the AG codes on general linear groups are found. The hyperplane sections having the minimum (or maximum) number of rational points are determined.
We determine the characters of the simple composition factors and the submodule lattices of certain Weyl modules for classical groups. The results have several applications. The simple modules arise in the study of incidence systems in…
A localized quantum unipotent coordinate category $\widetilde{\mathscr{C}_w}$ associated with a Weyl group element $w$ is a rigid monoidal category which is obtained by applying the localization process to a subcategory of the category of…
To capture important physical properties of a spacetime we construct a new diagram, the card diagram, which accurately draws generalized Weyl spacetimes in arbitrary dimensions by encoding their global spacetime structure, singularities,…
It is shown that a large class of systems of non-linear wave equations, based on the good-bad-ugly model, admit formal solutions with polyhomogeneous expansions near null infinity. A particular set of variables is introduced which allows us…
This paper investigates the application of the theoretical algebraic notion of a separable ring extension, in the realm of cyclic convolutional codes or, more generally, ideal codes. We work under very mild conditions, that cover all…
Following the general idea of Schur--Weyl scheme and using two suitable symmetric groups (instead of one), we try to make more explicit the classical problem of decomposing tensor representations of finite and infinite symmetric groups into…
A Weyl group W is a union of strata (certain subsets which are unions of conjugacy classes) which are the nonempty fibres of a map from W to the set of irreducible representations of W. We give an explicit description of strata in terms of…
The Weyl integration model presented by An and Wang can be effectively used to reduce the integration over $G$-space. In this paper, we construct an especial Weyl integration model for KAK decomposition of Reductive Lie Group and obtain an…
Erasure codes play an important role in storage systems to prevent data loss. In this work, we study a class of erasure codes called Multi-Erasure Locally Recoverable Codes (ME-LRCs) for storage arrays. Compared to previous related works,…
We improve Levenshtein's upper bound for the cardinality of a code of length four that is capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we construct…
The Weyl groups of the fine gradings with infinite universal grading group on $\mathfrak{e}_6$ are given.
This paper investigates the concept of self-dual convolutional code. We derive the basic properties of this interesting class of codes and we show how some of the techniques to construct self-dual linear block codes generalize to self-dual…
List decoding of insertions and deletions in the Levenshtein metric is considered. The Levenshtein distance between two sequences is the minimum number of insertions and deletions needed to turn one of the sequences into the other. In this…
The insertion-deletion codes were motivated to correct the synchronization errors. In this paper we prove several coordinate-ordering-free upper bounds on the insdel distances of linear codes, which are based on the generalized Hamming…