An abundance of invariant polynomials satisfying the Riemann hypothesis (Q998384): Difference between revisions

The zeta function for a linear code is defined as a generating function of its Hamming weight enumerator. It can also be defined for other homogeneous polynomials not related to existing codes. If the homogeneous polynomial is invariant under the MacWilliams transform, then its zeta function satisfies a functional equation and an analogue of the Riemann hypothesis can be formulated. In this paper, the authors show that there are abundant polynomials invariant by the MacWilliams transform which satisfy the Riemann hypothesis. The proof is carried out by explicit construction of such polynomials. The results are applied to the MDS codes, the general Hamming code Ham(\(r, q\)), and the Golay codes.