Abstract:In the theory of error-correcting codes, the minimum weight and the weight enumerator play a crucial role in evaluating the error-correcting performance. In this paper, by viewing the weight enumerator as a quasi-polynomial, we reduce the determination of the minimum weight of the resulting family to finitely many representative values of $q$. We also give a transformation formula between the Tutte quasi-polynomial and the weight enumerator. Furthermore, we compute the number of full-support codewords for the codes related to the special matroids $N_k$ and $Z_k$. This is equivalent to computing the characteristic quasi-polynomials of the hyperplane arrangements related to $N_k$ and $Z_k$.
From: Norihiro Nakashima [view email]
[v1]
Wed, 28 Jan 2026 23:33:23 UTC (28 KB)
[v2]
Fri, 11 Sep 2026 10:27:09 UTC (33 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。