English
Related papers

Related papers: Representations of Lie Algebras and Coding Theory

200 papers

We construct linear codes over the finite field Fq from arbitrary simplicial complexes, establishing a connection between topological properties and fundamental coding parameters. First, we study the behaviour of the weights of codewords…

Information Theory · Computer Science 2026-03-05 Antonio Jesús Lorite López , Daniel Camazón Portela , Juan Antonio López Ramos

Linear codes are the most important family of codes in cryptography and coding theory. Some codes have only a few weights and are widely used in many areas, such as authentication codes, secret sharing schemes and strongly regular graphs.…

Information Theory · Computer Science 2024-05-20 Shudi Yang , Tonghui Zhang , Zheng-An Yao

A lower bound on the number of uncorrectable errors of weight half the minimum distance is derived for binary linear codes satisfying some condition. The condition is satisfied by some primitive BCH codes, extended primitive BCH codes,…

Information Theory · Computer Science 2008-04-30 Kenji Yasunaga , Toru Fujiwara

Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$.…

Information Theory · Computer Science 2015-06-08 Steven T. Dougherty , Jon-Lark Kim , Buket Ozkaya , Lin Sok , Patrick Solé

We construct irreducible modules of centrally-extended classical Lie algebras over left ideals of the algebra of differential operators on the circle, through certain irreducible modules of centrally-extended classical Lie algebras of…

Quantum Algebra · Mathematics 2007-05-23 Xiaoping Xu

A weight basis for each finite-dimensional irreducible representation of the orthogonal Lie algebra o(2n) is constructed. The basis vectors are parametrized by the D-type Gelfand--Tsetlin patterns. Explicit formulas for the matrix elements…

Representation Theory · Mathematics 2007-05-23 A. I. Molev

Kim et al. (2021) gave a method to embed a given binary $[n,k]$ code $\mathcal{C}$ $(k = 3, 4)$ into a self-orthogonal code of the shortest length which has the same dimension $k$ and minimum distance $d' \ge d(\mathcal{C})$. We extend this…

Information Theory · Computer Science 2022-06-28 Jon-Lark Kim , Whan-Hyuk Choi

Orthogonal designs are fundamental mathematical notions used in the construction of space time block codes for wireless transmissions. Designs have two important parameters, the rate and the decoding delay; the main problem of the theory is…

Information Theory · Computer Science 2012-03-05 Sophie Morier-Genoud , Valentin Ovsienko

We begin a systematic study of unitary representations of minimal $W$-algebras. In particular, we classify unitary minimal $W$-algebras and make substantial progress in classification of their unitary irreducible highest weight modules. We…

Representation Theory · Mathematics 2023-07-03 Victor G. Kac , Pierluigi Möseneder Frajria , Paolo Papi

There is a local ring $E$ of order $4,$ without identity for the multiplication, defined by generators and relations as $E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b\rangle.$ We study a special construction of self-orthogonal…

Information Theory · Computer Science 2021-06-15 Minjia Shi , Shukai Wang , Jon-Lark Kim , Patrick Solé

We discuss the category $\cal I$ of level zero integrable representations of loop algebras and their generalizations. The category is not semisimple and so one is interested in its homological properties. We begin by looking at some…

Representation Theory · Mathematics 2010-09-08 Vyjayanthi Chari

The study of constant-weight codes in $\ell_1$-metric was motivated by the duplication-correcting problem for data storage in live DNA. It is interesting to determine the maximum size of a code given the length $n$, weight $w$, minimum…

Combinatorics · Mathematics 2020-11-11 Xin Wei , Tingting Chen , Xiande Zhang

Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many…

Information Theory · Computer Science 2018-08-14 Sihem Mesnager , Ahmet Sınak

We construct every finite-dimensional irreducible representation of the simple Lie algebra of type $\mathsf{E}_{7}$ whose highest weight is a nonnegative integer multiple of the dominant minuscule weight associated with the type…

Representation Theory · Mathematics 2023-03-14 Robert G. Donnelly , Molly W. Dunkum , Austin White

In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…

Information Theory · Computer Science 2022-01-03 Yansheng Wu , Chengju Li , Fu Xiao

We show that the representation theory for the toroidal extended affine Lie algebras is controlled by a vertex operator algebra which is a tensor product of four VOAs: a sub-VOA of the hyperbolic lattice VOA, two affine VOAs and a Virasoro…

Representation Theory · Mathematics 2009-10-13 Yuly Billig

In this paper, for every $\epsilon\in \mathbb{Z}$, we introduce an extension of the 2-toroidal Lie algebra by certain derivations. Based on the $\phi_\epsilon$-coordinated modules theory for vertex algebras, we give an explicit realization…

Quantum Algebra · Mathematics 2022-03-23 Fulin Chen , Huansheng Li , Nina Yu

For certain nilpotent real Lie groups constructed as semidirect products, algebras of invariant differential operators on some coadjoint orbits are used in the study of boundedness properties of the Weyl-Pedersen calculus of their…

Representation Theory · Mathematics 2014-11-06 Ingrid Beltita , Daniel Beltita , Mihai Pascu

The notion of Weyl modules, both local and global, goes back to Chari and Pressley in the case of affine Lie algebras, and has been extensively studied for various Lie algebras graded by root systems. We extend that definition to a certain…

Representation Theory · Mathematics 2024-11-27 Vladimir Dotsenko , Sergey Mozgovoy

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over…

Information Theory · Computer Science 2013-10-08 Cunsheng Ding , Zhengchun Zhou