Related papers: Weighted Generating Functions for Type II Lattices…
We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…
We present completions of mock theta functions to harmonic weak Maass forms of weight $1/2$ and algebraic formulas for the coefficients of mock theta functions. We give several harmonic weak Maass forms of weight $1/2$ that have mock theta…
In this paper we find the second generalized Hamming weight of some evaluation codes arising from a projective torus, and it allows to compute the second generalized Hamming weight of the codes parameterized by the edges of any complete…
In the present paper, we give harmonic weight enumerators and Jacobi polynomials for the first-order Reed--Muller codes and the extended Hamming codes. As a corollary, we show the nonexistence of combinatorial $4$-designs in these codes.
Polar codes can be viewed as decreasing monomial codes, revealing a rich algebraic structure governed by the lower-triangular affine (LTA) group. We develop a general framework to compute the Hamming weight of codewords generated by sums of…
We develop a new method for representing Hilbert series based on the highest weight Dynkin labels of their underlying symmetry groups. The method draws on plethystic functions and character generating functions along with Weyl integration.…
We study the space of vector valued theta functions for the Weil representation of a positive definite even lattice of rank two with fundamental discriminant. We work out the relation of this space to the corresponding scalar valued theta…
In this paper, we characterize the MacWilliams extension property (MEP) and constant weight codes with respect to $\omega$-weight defined on $\mathbb{F}^{\Omega}$ via an elementary approach, where $\mathbb{F}$ is a finite field, $\Omega$ is…
In the theory of error-correcting codes, the minimum weight and the weight enumerator play a crucial role in evaluating the error-correcting capacity. In this paper, by viewing the weight enumerator as a quasi-polynomial, we reduce the…
This paper is dedicated to the analysis and detailed study of a procedure to generate both the weighted arithmetic and harmonic means of $n$ positive real numbers. Together with this interpretation, we prove some relevant properties that…
This paper is concerned with the affine-invariant ternary codes which are defined by Hermitian functions. We compute the incidence matrices of 2-designs that are supported by the minimum weight codewords of these ternary codes. The linear…
Recent works, mostly related to Ramanujan's mock theta functions, make use of the fact that harmonic weak Maass forms can be combinatorial generating functions. Generalizing works of Waldspurger, Kohnen and Zagier, we prove that such forms…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
The hyperoctahedral group is the Weyl group of type B and is associated with a two-parameter family of differential-difference operators T_i, i=1,..,N (the dimension of the underlying Euclidean space). These operators are analogous to…
In 1999, Iwan Duursma defined the zeta function for a linear code as a generating function of its Hamming weight enumerator. It can also be defined for other homogeneous polynomials not corresponding to existing codes. If the homogeneous…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…
Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…