Related papers: Perfect Codes for Generalized Deletions from Minus…

Explicit bases for the subfield subcodes of projective Reed-Muller codes over the projective plane and their duals are obtained. In particular, we provide a formula for the dimension of these codes. For the general case over the projective…

The purpose of this paper is to describe a general procedure for computing analogues of Young's seminormal representations of the symmetric groups. The method is to generalize the Jucys-Murphy elements in the group algebras of the symmetric…

We classify, in terms of the structure of the finite group G, all group algebras KG for which all right ideals are right annihilators of principal left ideals. This means in the language of coding theory that we classify code-checkable…

Let g be a semisimple Lie algebra over the real numbers. We describe an explicit combinatorial construction of the real Weyl group of g with respect to a given Cartan subalgebra. An efficient computation of this Weyl group is important for…

Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…

In this note we introduce the concept of group convolutional code. We make a complete classification of the minimal $S_3$-convolutional codes over the field of five elements by means of Jategaonkar's theorems.

We show that if a graded submodule of a Noetherian module cannot be written as a proper intersection of graded submodules, then it cannot be written as a proper intersection of submodules at all. More generally, we show that a natural…

Let W be a Weyl group, presented as a crystallographic reflection group on a Euclidean vector space V, and C an open Weyl chamber. In a recent paper, Waldspurger proved that the images (id-w)(C), for Weyl group elements w, are all disjoint,…

A relationship between continued fractions and Weyl groupoids of Cartan schemes of rank two is found. This allows to decide easily if a given Cartan scheme of rank two admits a finite root system. We obtain obstructions and sharp bounds for…

We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.

In this paper the Weyl tensor is used to define operators that act on the space of forms. These operators are shown to have interesting properties and are used to classify the Weyl tensor, the well known Petrov classification emerging as a…

We present a construction of subspace codes along with an efficient algorithm for list decoding from both insertions and deletions, handling an information-theoretically maximum fraction of these with polynomially small rate. Our…

Let $ x $ be an element of a finite group $ G $ and denote the order of $ x $ by $ \mathrm{ord}(x) $. We consider a finite group $ G $ such that $ \gcd(\mathrm{ord}(x),\mathrm{ord}(y))\leqslant 2 $ for any two vanishing elements $ x $ and $…

In previous work, we showed that there are appropriate model category structures on the category of simplicial categories and on the category of Segal precategories, and that they are Quillen equivalent to one another and to Rezk's complete…

This paper is concerned with integrals which integrands are the monomials of matrix elements of irreducible representations of classical groups. Based on analysis on Young tableaux, we discuss some related duality theorems and compute the…

Suppose $G$ is a reductive algebraic group, $T$ is a Cartan subgroup, $N=\text{Norm}(T)$, and $W=N/T$ is the Weyl group. If $w\in W$ has order $d$, it is natural to ask about the orders lifts of $w$ to $N$. It is straightforward to see that…

In this work, we study the problem of list decoding of insertions and deletions. We present a Johnson-type upper bound on the maximum list size. The bound is meaningful only when insertions occur. Our bound implies that there are binary…

In this note a combinatorial formula related to the symmetric group is generalized to an arbitrary finite Weyl group.

The purpose of this article is to investigate relations between W-superalgebras and integrable super-Hamiltonian systems. To this end, we introduce the generalized Drinfel'd-Sokolov (D-S) reduction associated to a Lie superalgebra $g$ and…

A numerical semigroup is a subset of N containing 0, closed under addition and with finite complement in N. An important example of numerical semigroup is given by the Weierstrass semigroup at one point of a curve. In the theory of…