Results on zeta functions for codes
Combinatorics
2007-07-16 v1 Information Theory
math.IT
Number Theory
Abstract
We give a new and short proof of the Mallows-Sloane upper bound for self-dual codes. We formulate a version of Greene's theorem for normalized weight enumerators. We relate normalized rank-generating polynomials to two-variable zeta functions. And we show that a self-dual code has the Clifford property, but that the same property does not hold in general for formally self-dual codes.
Cite
@article{arxiv.math/0302172,
title = {Results on zeta functions for codes},
author = {I. M. Duursma},
journal= {arXiv preprint arXiv:math/0302172},
year = {2007}
}
Comments
12 pages