Related papers: Representations of Lie Algebras and Coding Theory

Locally affine Lie algebras are generalizations of affine Kac--Moody algebras with Cartan subalgebras of infinite rank whose root system is locally affine. In this note we study a class of representations of locally affine algebras…

In vertex algebra theory, fusion rules are described as the dimension of the vector space of intertwining operators between three irreducible modules. We describe fusion rules in the category of weight modules for the Weyl vertex algebra.…

We describe a systematic method to construct arbitrary highest-weight modules, including arbitrary finite-dimensional representations, for any finite dimensional simple Lie algebra $\mathfrak{g}$. The Lie algebra generators are represented…

It is known that characters of irreducible representations of finite Lie algebras can be obtained using theWeyl character formula including Weyl group summations which make actual calculations almost impossible except for a few Lie algebras…

Let $\mathbb{Z}_4$ denote the ring of integers modulo $4$. The Galois ring GR$(4,m)$, which consists of $4^m$ elements, represents the Galois extension of degree $m$ over $\mathbb{Z}_4$. The constructions of codes over $\mathbb{Z}_4$ have…

The structure of a linear block code is pivotal in defining fundamental properties, particularly weight distribution, and code design. In this study, we characterize the Type II structure of polar codewords with weights less than twice the…

Dominant weight multiplicities of simple Lie groups are expressed in terms of the modular matrices of Wess-Zumino-Witten conformal field theories, and related objects. Symmetries of the modular matrices give rise to new relations among…

We study the growth of representations of the Lie algebra of vector fields on the affine space that admit a compatible action of the polynomial algebra. We establish the Bernstein inequality for these representations, enabling us to focus…

A generator matrix of a linear code $\C$ over $\gf(q)$ is also a matrix of the same rank $k$ over any extension field $\gf(q^\ell)$ and generates a linear code of the same length, same dimension and same minimum distance over $\gf(q^\ell)$,…

Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…

Code loops are Moufang loops constructed from doubly even binary codes. Then, given a code loop L, we ask which doubly even binary code V produces L. In this sense, V is called a representation of L. In this article we define and determine…

The irreducible integrable representations with finite-dimensional weight spaces of toroidal Lie algebras on which the center acts non-trivially were classified by S.Eswara Rao. In this paper we give a compact proof of the results that lead…

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we present the explicit complete weight enumerator of a family of $p$-ary linear codes constructed with defining…

Ten types of discrete Fourier transforms of Weyl orbit functions are developed. Generalizing one-dimensional cosine, sine and exponential, each type of the Weyl orbit function represents an exponential symmetrized with respect to a subgroup…

Three classes of binary linear codes with at most four nonzero weights were constructed in this paper, in which two of them are projective three-weight codes. As applications, $s$-sum sets for any odd $ s > 1$ were constructed.

In this paper, several classes of three-weight ternary linear codes from non-weakly regular dual-bent functions are constructed based on a generic construction method. Instead of the whole space, we use the subspaces $B_+(f)$ or $B_-(f)$…

We study a vertex operator algebra containing a tensor product of Ising models. It is a direct sum of code vertex operator algebra and its irreducible modules. Therefore, we classify all irreducible modules of code vertex operator algebras…

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary…

Minimum distance is an important parameter of a linear error correcting code. For improved performance of binary Low Density Parity Check (LDPC) codes, we need to have the minimum distance grow fast with n, the codelength. However, the best…

It is shown that the residue code of a self-dual $\mathbb{Z}_4$-code of length $24k$ (resp.\ $24k+8$) and minimum Lee weight $8k+4 \text{ or }8k+2$ (resp.\ $8k+8 \text{ or }8k+6$) is a binary extremal doubly even self-dual code for every…