Related papers: A note on the generalized Hamming weights of Reed-…
Linearized Reed-Solomon codes are defined. Higher weight distribution of those codes are determined.
In this paper, we consider representations of integers as sums of at most four distinct $m$-gonal numbers (allowing a fixed number of repeats of each polygonal number occurring in the sum). We show that the number of such representations…
We introduce the \verb|Macaulay2| package \verb|RepHomology| for the computations of representation homology of certain spaces. The main methods implement computing the representation homology of surfaces (with group coefficients, and…
We develop a general framework for studying relative weight representations for certain pairs consisting of an associative algebra and a commutative subalgebra. Using these tools we describe projective and simple weight modules for quantum…
The Weyl-Kac character formula gives a beautiful closed-form expression for the characters of integrable highest-weight modules of Kac-Moody algebras. It is not, however, a formula that is combinatorial in nature, obscuring positivity. In…
In 1970 Delsarte, Goethals and Mac Williams published a seminal paper on generalized Reed-Muller codes where, among many important results, they proved that the minimal weight codewords of these codes are obtained through the evaluation of…
We derive a recursive formula determing the weight distribution of the [n=(q^m-1)/(q-1), n-m, 3] Hamming code H(m,q), when (m, q-1)=1. Here q is a prime power. The proof is based on Moisio's idea of using Pless power moment identity…
We consider recursive decoding for Reed-Muller (RM) codes and their subcodes. Two new recursive techniques are described. We analyze asymptotic properties of these algorithms and show that they substantially outperform other decoding…
We introduce the notion of a generalized representation of a Jordan algebra with unit. The greneralized representation has the following properties: (1) Usual representations and Jacobson representations correspond to special cases of…
Following Johnsen and Verdure (2013), we can associate to any linear code $C$ an abstract simplicial complex and in turn, a Stanley-Reisner ring $R_C$. The ring $R_C$ is a standard graded algebra over a field and its projective dimension is…
We define and study a class of Reed-Muller type error-correcting codes obtained from elementary symmetric functions in finitely many variables. We determine the code parameters and higher weight spectra in the simplest cases.
Let $M$ be a discrete-time normal martingale that has the chaotic representation property. Then, from the space of square integrable functionals of $M$, one can construct generalized functionals of $M$. In this paper, by using a type of…
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…
Universal security over a network with linear network coding has been intensively studied. However, previous linear codes used for this purpose were linear over a larger field than that used on the network. In this work, we introduce new…
In this note we show that the minimum distance of a linear code equals one plus the smallest shift in the first step of the minimal graded free resolution of the Orlik-Terao algebra (i.e., the initial degree of the Orlik-Tearo ideal)…
In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…
Generalized integral formulas involving the generalized Bessel-Maitland function are considered and it expressed in terms of generalized Wright hypergeometric functions. By assuming appropriate values of the parameters in the main results,…
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 the 1960s, MacWilliams proved that the Hamming weight enumerator of a linear code over a finite field completely determines, and is determined by, the Hamming weight enumerator of its dual code. In particular, if two linear codes have…
For a dominant integral weight $lambda $, we introduce a family of $U_q ^+ (mathfrak{g})$-submodules $V_w (lambda)$ of the irreducible highest weight $U_q (mathfrak{g})$-module $V(lambda)$ of highest weight $lambda $ for a generalized…