Related papers: Representations of Lie Algebras and Coding Theory

In this short note we announce three formulas for the set of weights of various classes of highest weight modules $\V$ with highest weight \lambda, over a complex semisimple Lie algebra $\lie{g}$ with Cartan subalgebra $\lie{h}$. These…

Polar codes form a very powerful family of codes with a low complexity decoding algorithm that attain many information theoretic limits in error correction and source coding. These codes are closely related to Reed-Muller codes because both…

We consider the group algebra over the field of complex numbers of the Weyl group of type B (the hyperoctahedral group, or the group of signed permutations) and of the Weyl group of type D (the demihyperoctahedral group, or the group of…

For any simple complex Lie group we classify irreducible finite-dimensional representations $\rho$ for which the longest element $w_0$ of the Weyl group acts nontrivially on the zero weight space. Among irreducible representations that have…

Both maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes (non-GRS MDS codes) and near MDS (NMDS) codes have nice applications in communication and storage systems. In this paper, we…

Linear complementary dual (LCD) codes are linear codes that intersect with their dual codes trivially. We study the largest minimum weight $d_2(n,k)$ among all binary LCD $[n,k]$ codes and the largest minimum weight $d_3(n,k)$ among all…

We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength $2k$. Our LP bounds develop in two alternative scenarios. First, if a point $y \in F_2^n$, where the covering…

Recently, linear codes constructed from defining sets have been investigated extensively and they have many applications. In this paper, for an odd prime $p$, we propose a class of $p$-ary linear codes by choosing a proper defining set.…

Selfdual representations of any group fall into two classes when they are irreducible: those which carry a symmetric bilinear form, and the others which carry an alternating bilinear form. The Langlands correspondence, which matches the…

In this paper we generalize the construction of binary self-orthogonal codes obtained from weakly self-orthogonal designs described by Tonchev in [12] in order to obtain self-orthogonal codes over an arbitrary field. We extend construction…

Let G be a connected, adjoint, simple algebraic group over the complex numbers with a maximal torus T and a Borel subgroup B containing T. The study of zero weight spaces in irreducible representations of G has been a topic of considerable…

We study representations of simply-laced Weyl groups which are equipped with canonical bases. Our main result is that for a large class of representations, the separable elements of the Weyl group $W$ act on these canonical bases by…

We construct an L^2-model of "very small" irreducible unitary representations of simple Lie groups G which, up to finite covering, occur as conformal groups Co(V) of simple Jordan algebras V. If $V$ is split and G is not of type A_n, then…

Let $W_n^+$ be the Lie algebra of the Lie algebra of vector fields on $\C^n$. In this paper, we classify all simple bounded weight $W_n^+$ modules. Any such module is isomorphic to the simple quotient of a tensor module $F(P,M)=P\otimes M$…

This review paper contains a concise introduction to highest weight representations of infinite dimensional Lie algebras, vertex operator algebras and Hilbert schemes of points, together with their physical applications to elliptic genera…

Let $\mathbb K$ be an algebraically closed field of characteristic zero. Let $V$ be a module over the polynomial ring $\mathbb K[x,y]$. The actions of $x$ and $y$ determine linear operators $P$ and $Q$ on $V$ as a vector space over $\mathbb…

Based on a generic construction, two classes of ternary three-weight linear codes are obtained from a family of power functions, including some APN power functions. The weight distributions of these linear codes are determined through…

We give two methods for constructing many linear complementary dual (LCD for short) codes from a given LCD code, by modifying some known methods for constructing self-dual codes. Using the methods, we construct binary LCD codes and…

The weight distribution and weight hierarchy of linear codes are two important research topics in coding theory. In this paper, by choosing proper defining sets from inhomogeneous quadratic functions over $\mathbb{F}_{q}^{2},$ we construct…

Recently, minimal linear codes have been extensively studied due to their applications in secret sharing schemes, secure two-party computations, and so on. Constructing minimal linear codes violating the Ashikhmin-Barg condition and then…