Duality of codes supported on regular lattices, with an application to enumerative combinatorics

TL;DR

This paper develops a lattice-theoretic framework for regular weights on finite abelian groups, establishing duality, MacWilliams identities, and applications to extremal codes and enumerative combinatorics.

Contribution

It introduces a new class of regular weights based on lattice support maps, extending classical coding theory results and providing tools for combinatorial enumeration.

Findings

MacWilliams identities hold for the new class of weights.

Every finite abelian group admits weights with duality and metric properties.

Closed-form formulas for counting matrices with prescribed rank and conditions.

Abstract

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 suitable support map with the rank function of a graded lattice satisfying certain regularity properties. A regular weight on a group canonically induces a regular weight on the character group, and invertible MacWilliams identities always hold for such a pair of weights. Moreover, the Krawtchouk coefficients of the corresponding MacWilliams transformation have a precise combinatorial significance, and can be expressed in terms of the invariants of the underlying lattice. In particular, they are easy to compute in many examples. Several weight functions traditionally studied in Coding Theory belong to the class of weights introduced in this paper. Our lattice-theory approach also offers a control on metric structures that a regular weight induces on the underlying group. In particular, it allows to show that every finite abelian group admits weight functions that, simultaneously, give rise to MacWilliams identities, and endow the underlying group with a metric space structure. We propose a general notion of extremality for (not necessarily additive) codes in groups endowed with semi-regular supports, and establish a Singleton-type bound. We then investigate the combinatorics and duality theory of extremal codes, extending classical results on the weight and distance distribution of error-correcting codes. Finally, we apply the theory of MacWilliams identities to enumerative combinatorics problems, obtaining closed formulae for the number of rectangular matrices over a finite having prescribed rank and satisfying some linear conditions.