Extremal weight enumerators and ultraspherical polynomials.

DOI10.1016/S0012-365X(02)00683-0zbMath1039.94015MaRDI QIDQ1398258

Iwan M. Duursma

Publication date: 29 July 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Riemann hypothesis; Gegenbauer polynomial; Divisible code; Extremal code; Minimum distance bound

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

33C45: Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.)

94B65: Bounds on codes

11T24: Other character sums and Gauss sums

Related Items

Self-inversive polynomials, curves, and 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, 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, 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