Related papers: Representations of Lie Algebras and Coding Theory
In this paper we present Affine.m - program for computations in representation theory of finite-dimensional and affine Lie algebras and describe implemented algorithms. Algorithms are based upon the properties of weights and Weyl symmetry.…
The conformal transformations with respect to the metric defining the orthogonal Lie algebra o(n) give rise to a one-parameter (c) family of inhomogeneous first-order differential operator representations of the orthogonal Lie algebra…
A general method for computing irreducible representations of Weyl groups and Iwahori-Hecke algebras was introduced earlier by the first author. The representations of the algebras of types $A_n$, $B_n$, $D_n$ and $G_2$ were computed and it…
We present the Mathematica application LieART (Lie Algebras and Representation Theory) for computations frequently encountered in Lie Algebras and representation theory, such as tensor product decomposition and subalgebra branching of…
Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…
Linear codes with complementary duals are linear codes whose intersection with their duals are trivial, shortly named LCD codes. In this paper we outline a construction for LCD codes over finite fields of order $q$ using weighing matrices…
This paper completes a series devoted to explicit constructions of finite-dimensional irreducible representations of the classical Lie algebras. Here the case of odd orthogonal Lie algebras (of type B) is considered (two previous papers…
Minimal codes are a class of linear codes which gained interest in the last years, thanks to their connections to secret sharing schemes. In this paper we provide the weight distribution and the parameters of families of minimal codes…
In this work, we define three composite matrices derived from group rings. We employ these composite matrices to create generator matrices of the form [In | {\Omega}(v)], where In is the identity matrix and {\Omega}(v) is a composite matrix…
In this article we present a class of codes with few weights arising from special type of linear sets. We explicitly show the weights of such codes, their weight enumerator and possible choices for their generator matrices. In particular,…
Bounds on linear codes play a central role in coding theory, as they capture the fundamental trade-off between error-correction capability (minimum distance) and information rate (dimension relative to length). Classical results…
Boolean functions have very nice applications in cryptography and coding theory, which have led to a lot of research focusing on their applications. The objective of this paper is to construct binary linear codes with few weights from the…
Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communications. In this paper, we construct several classes of binary…
As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research…
We show that each irreducible tensor representation of weight 2 of the rotation group of three-dimensional space in the space of rank 3 covariant tensors gives rise to an associative algebra with unity. We find the algebraic relations that…
Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…
The weight systems of finite-dimensional representations of complex, simple Lie algebras exhibit patterns beyond Weyl-group symmetry. These patterns occur because weight systems can be decomposed into lattice polytopes in a natural way.…
In the field of algebraic geometric codes (AG codes), the characterization of dual codes has long been a challenging problem which relies on differentials. In this paper, we provide some descriptions for certain differentials utilizing…
We define categories $\mathcal{O}^w$ of representations of Borel subalgebras $\mathcal{U}_q\mathfrak{b}$ of quantum affine algebras $\mathcal{U}_q\hat{\mathfrak{g}}$, which come from the category $\mathcal{O}$ twisted by Weyl group elements…
Binary constant weight codes have important applications and have been studied for many years. Optimal or near-optimal binary constant weight codes of small lengths have been determined. In this paper we propose a new construction of…