Divisible formal weight enumerators and extremal polynomials not satisfying the Riemann hypothesis

DOI10.1016/j.disc.2019.111601zbMath1421.11104arXiv1709.03380OpenAlexW2965888721WikidataQ127404409 ScholiaQ127404409MaRDI QIDQ2329187

Koji Chinen

Publication date: 17 October 2019

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

Full work available at URL: https://arxiv.org/abs/1709.03380

zbMATH Keywords

Riemann hypothesisdivisible codeformal weight enumeratorzeta function for codesinvariant polynomial ringbinomial moment

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items

ON THE RIEMANN HYPOTHESIS FOR A CERTAIN FAMILY OF FORMAL WEIGHT ENUMERATORS, Extremal invariant polynomials not satisfying the Riemann hypothesis, Formal weight enumerators and Chebyshev polynomials, On some families of certain divisible polynomials and their zeta functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zeta functions for formal weight enumerators and the extremal property
• An abundance of invariant polynomials satisfying the Riemann hypothesis
• Extremal weight enumerators and ultraspherical polynomials.
• Extremal invariant polynomials not satisfying the Riemann hypothesis
• Weight distributions of geometric Goppa codes
• On the notion of Jacobi polynomials for codes
• Shadow bounds for self-dual codes
• Finite Unitary Reflection Groups
• From weight enumerators to zeta functions