Extremal weight enumerators and ultraspherical polynomials.
The author establishes an upper bound for the minimum distance of a divisible code in terms of its dual distance, a result that generalizes the Mallows-Sloane bounds for self-dual codes. Moreover, there is a determination of zeta functions for the codes that attain this new bound. At the end of the paper are applications to self-dual and extremal self-dual codes.
scientific article; zbMATH DE number 1956033