Related papers: Perfect Codes for Generalized Deletions from Minus…
In this short survey we concern ourselves with minimal codes, a classical object in coding theory. We will explain the relation between minimal codes and various other mathematical domains, in particular with finite projective geometry.…
We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ratio between the size of optimal integer and fractional solutions is between 1 and 2 ln(|V|)+1 where V is the set of vertices of the graph.…
We show that various properties of unipotent elements in a reductive group over the complex numbers can be recovered purely in terms of the affine Weyl group of the dual group.
This paper presents categorifications of (right) cell modules and induced cell modules for Hecke algebras of finite Weyl groups. In type $A$ we show that these categorifications depend only on the isomorphism class of the cell module, not…
In this paper, we give a necessary and sufficient condition for a subgroup to be a perfect code for finite groups. As an application, we determine all subgroup perfect codes of extraspecial 2-groups and finite groups whose Sylow 2-subgroup…
Codes for correcting sticky insertions/deletions and limited-magnitude errors have attracted significant attention due to their applications of flash memories, racetrack memories, and DNA data storage systems. In this paper, we first…
Generalized Product (GPC) Codes, an unification of Product Codes and Integrated Interleaved (II) Codes, are presented. Applications for approaches requiring local and global parities are described. The more general problem of extending…
In a graph $\Gamma$, a perfect code is an independent set $C$ with the property that every vertex not in $C$ is adjacent to a unique vertex in $C$, and a total perfect code is a set $C$ of vertices of $\Gamma$ such that every vertex of…
Non-binary codes correcting multiple deletions have recently attracted a lot of attention. In this work, we focus on multiplicity-free codes, a family of non-binary codes where all symbols are distinct. Our main contribution is a new…
We present simple constructions of optimal erasure-correcting LRC codes by exhibiting their parity-check matrices. When the number of local parities in a parity group plus the number of global parities is smaller than the size of the parity…
Let $\K$ be a finite field and $X$ be a complete simplicial toric variety over $\K$. We give an algorithm relying on elimination theory for finding generators of the vanishing ideal of a subgroup $Y_Q$ parameterized by a matrix $Q$ which…
In this paper motivated from subspace coding we introduce subspace-metric codes and subset-metric codes. These are coordinate-position independent pseudometrics and suitable for the folded codes. The half-Singleton upper bounds for linear…
A general framework for the Weyl invariant quantization of Liouville field theory by means of an exact renormalization group equation is proposed. This flow equation describes the scale dependence of the effective average action which has a…
An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…
The action of a Weyl group on the associated weight lattice induces an additive action on the symmetric algebra and a multiplicative action on the group algebra of the lattice. We show that the coinvariant space of the multiplicative action…
Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous…
Fix a Dynkin diagram and let p be a coweight. When does there exist an element w of the corresponding Weyl group such that w is p-minuscule and w(p) is dominant? We answer this question for general Coxeter groups. We express and prove these…
For any ordinary irreducible character of a maximal reflection subgroup of type $D_aD_b$ of a type $D$ Weyl group we give an explicit decomposition of the induced character in terms of Littlewood-Richardson coefficients.
This paper presents general bounds on the highest achievable rate for list-decodable insertion-deletion codes. In particular, we give novel outer and inner bounds for the highest achievable communication rate of any insertion-deletion code…
We define precuspidal families in proper parabolic subgroups of a Weyl group and we show how to use them to index the irreducible representations of that Weyl group in terms of certain pairs of finite groups. Some additional material is…