From weight enumerators to zeta functions (Q5939236)

In a previous paper, the author introduced the zeta function of a linear code. The zeta function contains the same information as the weight distribution of a code but is presented in a way that resembles the classical zeta functions. This paper gives an alternative but equivalent definition based on puncturing and shortening operators acting on the linear code. The zeta function of some infinite families of divisible codes is calculated. The relation with the zeta function of an algebraic curve is given. The relation shows a very close analogy between the problem of estimating the optimal minimum distance of a self-dual code of given length and the problem of estimating the maximal number of rational points on an algebraic curve of a given genus. An analogue of the Riemann hypothesis is formulated. A relation between such a Riemann hypothesis and upper bounds on the parameters of linear codes is shown.