Jacobi polynomials, invariant rings, and generalized $t$-designs
Abstract
In the present paper, we provide results that relate the Jacobi polynomials in genus . We show that if a code is -homogeneous that is, the codewords of the code for every given weight hold a -design, then its Jacobi polynomial in genus with composition with can be obtained from its weight enumerator in genus~ using the polarization operator. Using this fact, we investigate the invariant ring, which relates the homogeneous Jacobi polynomials of the binary codes in genus . Specifically, the generators of the invariant ring appearing for are obtained. Moreover, we define the split Jacobi polynomials in genus~ and obtain the MacWilliams type identity for it. A split generalization for higher genus cases of the relation between the Jacobi polynomials and weight enumerator of a -homogeneous code also given.
Cite
@article{arxiv.2408.02229,
title = {Jacobi polynomials, invariant rings, and generalized $t$-designs},
author = {Himadri Shekhar Chakraborty and Nur Hamid and Tsuyoshi Miezaki and Manabu Oura},
journal= {arXiv preprint arXiv:2408.02229},
year = {2025}
}
Comments
24 pages