Abstract
Zeta functions for linear codes were defined by Iwan Duursma in 1999 as generating functions for the Hamming weight enumerators of linear codes. They were generalized to the case of some invariant polynomials and so-called the formal weight enumerators by the present author. One of the most important problems from the applicable point of view is whether extremal weight enumerators satisfy the Riemann hypothesis. In this article, we show there exist extremal polynomials of the weight enumerator type, not being related to existing codes, which are invariant under the MacWilliams transform and do not satisfy the Riemann hypothesis. Such examples are contained in a certain invariant polynomial ring which is found by the use of the binomial moment. We determine the group which fixes the ring. To formulate the extremal property, we also establish an analog of the Mallows–Sloane bound for a certain sequence of the members in the ring.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Applicable Algebra in Engineering, Communication and Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
