Related papers: Relative Generalized Hamming weights of affine Car…

We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we prove that if the size of the working finite field is large compared to the degree of the code, the low weight…

We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised C_{ab} curves the new bound often improves dramatically on the Feng-Rao bound for primary codes. The method…

We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC…

Using commutative algebra methods we study the generalized minimum distance function (gmd function) and the corresponding generalized footprint function of a graded ideal in a polynomial ring over a field. The number of solutions that a…

This paper is motivated by the study of Alperin's weight conjecture in the representation theory of finite groups. We generalize the notion of $e$-cuspidality in the $e$-Harish-Chandra theory of finite reductive groups, and define generic…

In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain first and second order differential equations for the orthogonal polynomials and associated functions with a weight on the unit circle. We…

In this paper, we study the third weight of generalized Reed-Muller codes. We prove under some restrictive condition that the third weight of generalized Reed-Muller codes depends on the third weight of generalized Reed-Muller codes of…

We give a recursive construction for projective Reed-Muller codes in terms of affine Reed-Muller codes and projective Reed-Muller codes in fewer variables. From this construction, we obtain the dimension of the subfield subcodes of…

We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a…

Let $\mathbb{F}_{q}$ be a finite field with $q$ elements, where $q$ is a power of prime $p$. A polynomial over $\mathbb{F}_{q}$ is square-free if all its monomials are square-free. In this note, we determine an upper bound on the number of…

The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we…

We show that permutation weights, which are previously introduced for finite Lie algebras, can be appropriately defined also for affine Lie algebras. This allows us to classify all the weights of an affine Weyl orbit explicitly. Let…

We study a relationship between the graded characters of generalized Weyl modules $W_{w \lambda}$, $w \in W$, over the positive part of the affine Lie algebra and those of specific quotients $V_{w}^- (\lambda) / X_{w}^- (\lambda)$, $w \in…

We give a concrete description of the category of etale algebras over the ring of Witt vectors of a given finite length with entries in an arbitrary ring. We do this not only for the classical p-typical and big Witt vector functors but also…

We study generalised core partitions arising from affine Grassmannian elements in arbitrary Dynkin type. The corresponding notion of size is given by the atomic length in the sense of [CLG22]. In this paper, we first develop the theory for…

We consider the standard modules of rectangular highest weights of affine Lie algebras in types $A_{2l-1}^{(2)}$ and $D_{l+1}^{(2)}$. By using vertex algebraic techniques we construct the combinatorial bases for standard modules and their…

We discuss a possible framework for the construction of a quantum gravity theory where the principles of QFT and general relativity can coexist harmonically. Moreover, in order to fix the correct gauge group of the theory we study the most…

Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid $M$. Our main result is that these polynomials are determined by Betti numbers associated with graded…

The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. GHWs are of great interest in many applications since they convey detailed information of linear codes. In this paper, we continue the work of [10] to study…

Using the notion of generalized weight we improve estimates on the parameters of quantum codes obtained by Steane's construction from binary codes. This yields several new families of quantum codes.