Harmonic higher weight distributions, Simonis' approach of MacWilliams identity and moments

Himadri Shekhar Chakraborty; Mehedi Hasan Tanver

Home/Archive/arXiv

arXiv · 2608.15864

Harmonic higher weight distributions, Simonis' approach of MacWilliams identity and moments

Himadri Shekhar Chakraborty·Mehedi Hasan Tanver

View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a combinatorial proof of Simonis type MacWilliams identity for harmonic higher weight distributions of linear codes. Furthermore, we investigate the statistical moments of the harmonic higher weight enumerators for random linear codes. Defining the enumerators via rank functions of the generator matrices of linear codes, we prove that its expectation vanishes for all non-trivial harmonic functions due to the inherent symmetry of random matrices, and we also derive an explicit, non-trivial formula for the covariance.

Explore related subjects

math.CO cs.IT math.IT math.NT

Keep this discovery

BibTeX RIS

Himadri Shekhar Chakraborty, Mehedi Hasan Tanver. 2026-08-21. Harmonic higher weight distributions, Simonis' approach of MacWilliams identity and moments. https://arxiv.org/abs/2608.15864

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.IT subject math.CO subject math.IT subject math.NT subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

arXiv2026

Edge codes constructed from unicyclic graphs

Jaramillo-Velez recently introduced edge codes, a new class of toric evaluation codes constructed from the edges of a (hyper)graph $\mathcal{H}$. In the case that $\mathcal{H}$ is a tree, Jaramillo-Velez computed both the minimum distance and the weight distribution of the associated code. In this paper, we study edge codes associated to unicyclic graphs. Our most striking result is that computing the parameters of these codes is subtle in the case that the induced cycle has an even length because these values will depend on certain conditions regarding the length of the cycle and the size of the base field.

math.CO↗

arXiv2026

Double Toeplitz codes and their average weight enumerators

Recently, double Toeplitz codes have been introduced as a generalization of double circulant codes. In this paper, we study the average weight enumerators of double Toeplitz codes. As an application, we consider the existence of double Toeplitz codes over $\mathbb{F}_q$ with some specified minimum weights for $q \in \{2,3,4\}$. We also give a classification of double Toeplitz codes over $\mathbb{F}_q$ with the largest minimum weights for moderate lengths and $q \in \{2,3,4\}$.

math.CO↗

arXiv2026

Column Number of Delta-modular matrices: Refined Analysis via Sauer Matrices

In this paper, we build upon the analysis initiated by Gennadiy Averkov and Matthias Schymura (2022) and establish that the number of distinct columns of a $Δ$-modular matrix $A \in \mathbb{Z}^{m \times n}$ of rank $m$ is $O(m^3 Δ)$. This upper bound was previously known only for odd values of $Δ$. Recall that a matrix is called $Δ$-modular if the maximum of the absolute values of its $m \times m$ minors equals $Δ$.

math.CO↗