Extremal weight enumerators and ultraspherical polynomials.

DOI10.1016/S0012-365X(02)00683-0MaRDI QIDQ1398258zbMATH OpenOpenAlexFDO

Authors Iwan Duursma

Publication date 29 July 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(02)00683-0

zbMATH Keywords

Divisible codeExtremal codeGegenbauer polynomialMinimum distance boundRiemann hypothesis

Mathematics Subject Classification ID

Other character sums and Gauss sums (11T24) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Bounds on codes (94B65)

Review text

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.

Recommendations

• From weight enumerators to zeta functions
• Extremal invariant polynomials not satisfying the Riemann hypothesis
• On some families of certain divisible polynomials and their zeta functions
• Zeta functions for formal weight enumerators and the extremal property
• A Riemann hypothesis analogue for self-dual codes

Cited in

(18)

• Weight distribution and dual distance
• A MacWilliams type identity on Lee weight for linear codes over \(\mathbb F_2 + u\mathbb F_2^\ast\)
• Relations between Möbius and coboundary polynomials
• Formal weight enumerators and Chebyshev polynomials
• Weight enumerators, intersection enumerators, and Jacobi polynomials
• Extremal invariant polynomials not satisfying the Riemann hypothesis
• Divisible formal weight enumerators and extremal polynomials not satisfying the Riemann hypothesis
• A Riemann hypothesis analogue for invariant rings
• A formula on the weight distribution of linear codes with applications to AMDS codes
• Weight enumerators, intersection enumerators and Jacobi polynomials. II
• Self-inversive polynomials, curves, and codes
• On the Riemann hypothesis for a certain family of formal weight enumerators
• Binomial moments for divisible self-dual codes
• On some families of certain divisible polynomials and their zeta functions
• Zeta functions for formal weight enumerators and the extremal property
• A MacWilliams type identity for matroids
• On a Riemann hypothesis analogue for selfdual weight enumerators of genus less than 3
• An abundance of invariant polynomials satisfying the Riemann hypothesis

This page was built for publication: Extremal weight enumerators and ultraspherical polynomials.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398258)