Related papers: Codes over Finite Ring $\mathbb{Z}_k$, MacWilliams…
Zeta functions for linear codes were defined by Iwan Duursma in 1999. They were generalized to the case of some invariant polynomials by the preset author. One of the most important problems is whether extremal weight enumerators satisfy…
Theta series for indefinite quadratic lattices were introduced by Zwegers, for signature (m-1,1), Alexandrov, Banerjee, Manschot and Pioline, for signature (m-2,2), and Nazaroglu, for signature (m-q,q). These series are modular modular…
In this paper, we establish the matroid structures corresponding to data-local and local maximally recoverable codes (MRC). The matroid structures of these codes can be used to determine the associated Tutte polynomial. Greene proved that…
We study the zeros of theta functions $\Theta_{\Gamma_{4k}}$ associated with the lattices $\Gamma_{4k}$, a family of self-dual lattices generalizing the $\mathsf{E}_{8}$ lattice. Our results show two different behaviors of the zeros…
We define zeta-functions of weight lattices of compact connected semisimple Lie groups. If the group is simply-connected, these zeta-functions coincide with ordinary zeta-functions of root systems of associated Lie algebras. In this paper…
This paper investigates general properties of codes with the rank metric. We first investigate asymptotic packing properties of rank metric codes. Then, we study sphere covering properties of rank metric codes, derive bounds on their…
Mimicking the idea of the generalized Hamming weight of linear codes, we introduce a new lattice invariant, the generalized theta series. Applications range from identifying stable lattices to the lattice isomorphism problem. Moreover, we…
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…
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…
In this paper we introduce a new class of extremal codes, namely the $i$-BMD codes. We show that for this family several of the invariants are determined by the parameters of the underlying code. We refine and extend the notion of an…
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…
In this note, we establish an analog of the Mallows-Sloane bound for Type III formal weight enumerators. This completes the bounds for all types (Types I through IV) in synthesis of our previous results. Next we show by using the binomial…
Let $k$ be a perfect field of characteristic $p > 2$. We extend the equivalence of categories between Fontaine-Laffaille modules and $\mathbb{Z}_p$ lattices inside crystalline representations with Hodge-Tate weights at most $p-2$ of…
We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also…
We give a new and short proof of the Mallows-Sloane upper bound for self-dual codes. We formulate a version of Greene's theorem for normalized weight enumerators. We relate normalized rank-generating polynomials to two-variable zeta…
MacWilliams identities relate the weight enumerators of a code with those of its dual and are classically formulated with respect to the Hamming weight. For other metrics, however, these identities often fail when considering the weight…
In this article, we prove a new general identity involving the Theta operators introduced by the first author and his collaborators in [D'Adderio, Iraci, Vanden Wyngaerd 2020]. From this result, we can easily deduce several new identities…
In this paper we study codes where the alphabet is a finite Frobenius bimodule over a finite ring. We discuss the extension property for various weight functions. Employing an entirely character-theoretic approach and a duality theory for…
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 is the first of two papers in which we introduce and study two bivariate zeta functions associated to unipotent group schemes over rings of integers of number fields. One of these zeta functions encodes the numbers of isomorphism…