English
Related papers

Related papers: Representations of Lie Algebras and Coding Theory

200 papers

A well-known result on Lie Theory states that every finite-dimensional complex solvable Lie algebra can be represented as a matrix Lie algebra, with upper-triangular square matrices as elements. However, this result does not specify which…

Representation Theory · Mathematics 2014-04-15 Manuel Ceballos , Juan Núñez , Ángel F. Tenorio

The study of linear codes over a finite field of odd cardinality, derived from determinantal varieties obtained from symmetric matrices of bounded rank, was initiated in a recent paper by the authors. There, one found the minimum distance…

Algebraic Geometry · Mathematics 2024-12-10 Peter Beelen , Trygve Johnsen , Prasant Singh

In this paper, we classify irreducible modules for loop extended Witt algebras with finite dimensional weight spaces. They turn out to be either modules with uniformly bounded weight spaces or highest weight modules. We further prove that…

Representation Theory · Mathematics 2022-12-12 Sachin S. Sharma , Priyanshu Chakraborty , Ritesh Kumar Pandey , S. Eswara Rao

We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight…

Information Theory · Computer Science 2025-12-10 Alessandro Neri , Paolo Santonastaso

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their…

Information Theory · Computer Science 2019-05-08 Gaopeng Jian

We construct irreducible modules for twisted toroidal Lie algebras and extended affine Lie algebras. This is done by combining the representation theory of untwisted toroidal algebras with the technique of thin coverings of modules. We…

Representation Theory · Mathematics 2010-02-12 Yuly Billig , Michael Lau

We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…

Information Theory · Computer Science 2022-12-16 Heide Gluesing-Luerssen , Alberto Ravagnani

We describe a new link between the theory of topological modular forms and representations of vertex operator algebras obtained by certain lattices. The construction is motivated by the arithmetic Whitehead tower of the orthogonal groups.…

Algebraic Topology · Mathematics 2021-10-18 Nora Ganter , Gerd Laures

Four families of generalizations of trigonometric functions were recently introduced. In the paper the functions are transformed into four families of orthogonal polynomials depending on two variables. Recurrence relations for construction…

Mathematical Physics · Physics 2015-03-17 Lenka Motlochova , Jiri Patera

Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…

Information Theory · Computer Science 2022-10-12 Ziling Heng , Xinran Wang , Xiaoru Li

The present paper deals with the representation theory of the reflection equation algebra, connected with a Hecke type R-matrix. Up to some reasonable additional conditions the R-matrix is arbitrary (not necessary originated from quantum…

Quantum Algebra · Mathematics 2009-11-10 P. A. Saponov

Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…

Information Theory · Computer Science 2016-01-27 Can Xiang , Chunming Tang , Keqin Feng

Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying certain conditions. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes…

Combinatorics · Mathematics 2016-08-19 Masaaki Harada , Sho Suda

An irreducible representation of a reductive Lie algebra, when restricted to a Cartan subalgebra, decomposes into weights with multiplicity. The first part of this paper outlines a procedure to compute symmetric polynomials (e.g., power…

Representation Theory · Mathematics 2026-02-03 Rohit Joshi , Steven Spallone

The study on minimal linear codes has received great attention due to their significant applications in secret sharing schemes and secure two-party computation. Until now, numerous minimal linear codes have been discovered. However, to the…

Information Theory · Computer Science 2024-03-19 Yanjun Li , Haibin Kan , Fangfang Liu , Jie Peng , Lijing Zheng , Zepeng Zhuo

Let $\mathcal{O}$ be a conic in the classical projective plane $PG(2,q)$, where $q$ is an odd prime power. With respect to $\mathcal{O}$, the lines of $PG(2,q)$ are classified as passant, tangent, and secant lines, and the points of…

Combinatorics · Mathematics 2009-11-12 Peter Sin , Junhua Wu , Qing Xiang

All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact…

Information Theory · Computer Science 2016-11-18 Iliya Bouyukliev , Erik Jakobsson

We investigate weight modules for finite and infinite Weyl algebras, classifying all such simple modules. We also study the representation type of the blocks of locally-finite weight module categories and describe indecomposable modules in…

Rings and Algebras · Mathematics 2007-05-23 Viktor Bekkert , Georgia Benkart , Vyacheslav Futorny

Linear codes with a few weights can be applied to communication, consumer electronics and data storage system. In addition, the weight hierarchy of linear codes has many applications such as on the type II wire-tap channel, dealing with…

Information Theory · Computer Science 2021-06-08 Fei Li , Xiumei Li

We give upper bounds for the number of irreducible representations of dimension at most n for a compact semisimple Lie group. In particular, we prove that there are at most n irreducible representations of dimension at most n for a simple…

Representation Theory · Mathematics 2010-03-17 Robert Guralnick , Michael Larsen , Corey Manack