Related papers: On an analogue of the doubling method in coding th…
The main theorem in this paper is a far-reaching generalization of Gleason's theorem on the weight enumerators of codes which applies to arbitrary-genus weight enumerators of self-dual codes defined over a large class of finite rings and…
In this paper, we define dual codes over arbitrary finite rings with respect to arbitrary bilinear forms and provide a generalization of Hayden's theorem (Bridges, Hall, and Hayden, 1981). Building on this foundation, we introduce the…
Let $K$ be a field, $\Gamma $ a finite group of field automorphisms of $K$, $F$ the $\Gamma $-fixed field in $K$ and $G\leq $GL$_v(K)$ a finite matrix group. Then the action of $\Gamma $ defines a grading on the symmetric algebra of the…
This article is a continuation of our recent work (Yin Chen and Runxuan Zhang, Shape enumerators of self-dual NRT codes over finite fields. SIAM J. Discrete Math. 38 (2024), no. 4, 2841-2854) in the setting of quantum error-correcting…
We introduce a general class of regular weight functions on finite abelian groups, and study the combinatorics, the duality theory, and the metric properties of codes endowed with such functions. The weights are obtained by composing a…
We give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of…
In this paper, we have introduced the concepts of support distribution and the support enumerator as refinements of the classical weight distribution and weight enumerator respectively, capturing coordinate level activity in linear block…
The aim of this paper is to introduce the categorical setup which helps us to relate the theory of Macdonald polynomials and the theory of Weyl modules for current Lie algebras discovered by V.\,Chari and collaborators. We identify…
We show that the category of graded modules over a finite-dimensional graded algebra admitting a triangular decomposition can be endowed with the structure of a highest weight category. When the algebra is self-injective, we show…
In this paper, we introduce Jacobi polynomial generalizations of several classical invariants in coding theory over finite fields, specifically, the higher and extended weight enumerators, and we establish explicit correspondences between…
Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical…
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.…
Self-dual codes over $\Z_2\times\Z_4$ are subgroups of $\Z_2^\alpha \times\Z_4^\beta$ that are equal to their orthogonal under an inner-product that relates to the binary Hamming scheme. Three types of self-dual codes are defined. For each…
This article develops a practical technique for studying representations of $\Bbbk$-linear categories arising in the categorification of quantum groups. We work in terms of locally unital algebras which are $\mathbb{Z}$-graded with graded…
In this paper, we study linear codes over $\mathbb{Z}_k$ based on lattices and theta functions. We obtain the complete weight enumerators MacWilliams identity and the symmetrized weight enumerators MacWilliams identity based on the theory…
Kra\'skiewicz and Pragacz introduced representations of the upper-triangular Lie algebras whose characters are Schubert polynomials. In a previous work the author studied the structure of Kra\'skiewicz-Pragacz modules using the theory of…
We describe a categorification of the Double Affine Hecke Algebra (${\mathcal{H}\kern -.4em\mathcal{H}}$) associated with an affine Lie algebra $\widehat{\mathfrak{g}}$, including a categorification of the polynomial representation and…
Gleason's 1970 theorem on weight enumerators of self-dual codes has played a crucial role for research in coding theory during the last four decades. Plenty of generalizations have been proved but, to our knowledge, they are all based on…
A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…
We introduce a path-theoretic framework for understanding the representation theory of (quantum) symmetric and general linear groups and their higher level generalisations over fields of arbitrary characteristic. Our first main result is a…