×

Divisible formal weight enumerators and extremal polynomials not satisfying the Riemann hypothesis. (English) Zbl 1421.11104

Summary: In this paper, first we formulate the notion of divisible formal weight enumerators and propose an algorithm for the efficient search of the formal weight enumerators divisible by two. The main tools are the binomial moments. It leads to the discovery of several new families of formal weight enumerators. Then, as a result, we find examples of extremal formal weight enumerators which do not satisfy the Riemann hypothesis.

MSC:

11T71 Algebraic coding theory; cryptography (number-theoretic aspects)
94B05 Linear codes (general theory)
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] K. Chinen, On some families of divisible formal weight enumerators and their zeta functions. arXiv:1709.03396; K. Chinen, On some families of divisible formal weight enumerators and their zeta functions. arXiv:1709.03396 · Zbl 1141.11321
[2] Chinen, K., Zeta functions for formal weight enumerators and the extremal property, Proc. Japan Acad. A., 81, 168-173 (2005) · Zbl 1141.11321
[3] Chinen, K., An abundance of invariant polynomials satisfying the Riemann hypothesis, Discrete Math., 308, 6426-6440 (2008) · Zbl 1156.94012
[4] Chinen, K., Extremal invariant polynomials not satisfying the Riemann hypothesis, Appl. Algebra Eng. Commun. Comput., 30, 275-284 (2019) · Zbl 1455.13011
[5] Conway, J. H.; Sloane, N. J.A., Sphere Packings, Lattices and Groups (1999), Springer Verlag: Springer Verlag NewYork · Zbl 0915.52003
[6] Duursma, I., Weight distribution of geometric Goppa codes, Trans. Amer. Math. Soc., 351, 9, 3609-3639 (1999) · Zbl 0927.94019
[7] Duursma, I., From weight enumerators to zeta functions, Discrete Appl. Math., 111, 55-73 (2001) · Zbl 0983.94041
[8] Duursma, I., A Riemann hypothesis analogue for self-dual codes, (DIMACS Series in Discrete Math. and Theoretical Computer Science, vol. 56 (2001)), 115-124 · Zbl 0998.94041
[9] Duursma, I., Extremal weight enumerators and ultraspherical polynomials, Discrete Math, 268, 1-3, 103-127 (2003) · Zbl 1039.94015
[10] MacWilliams, F. J.; Sloane, N. J.A., The Theory of Error-Correcting Codes (1977), North-Holland: North-Holland Amsterdam · Zbl 0369.94008
[11] Ozeki, M., On the notion of Jacobi polynomials for codes, Math. Proc. Cambridge Philos. Soc., 121, 15-30 (1997) · Zbl 0888.94028
[12] Pless, V. S., Introduction To the Theory of Error-Correcting Codes (1998), John Wiley & Sons: John Wiley & Sons NewYork · Zbl 0928.94008
[13] Rains, E. M., Shadow bounds for self-dual codes, IEEE Trans. Inform. Theory, 44, 1, 134-139 (1998) · Zbl 1053.94582
[14] Shephard, G. C.; Todd, J. A., Finite unitary reflection groups, Canad. J. Math., 6, 274-304 (1954) · Zbl 0055.14305
[15] Sloane, N. J.A., Self-dual codes and lattices, (Relations Between Combinatorics and Other Parts of Mathematics, Proceedings of Symposium on Pure Mathematics 34, Ohio State University, Columbus, OH, 1978 (1979), Amer. Math. Soc: Amer. Math. Soc Providence, RI), 273-308 · Zbl 0407.94009
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.