Results on zeta functions for codes

2003/02/14 by Iwan Duursma, I. M. Duursma, Duursma, I. M.
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #Coding theory and cryptography #DNA and Biological Computing #cs.IT #graph theory and CDMA systems #math.CO #math.IT #math.NT #msc:05B35 #msc:14G15 #msc:94B65

paper · pdf · doi:10.48550/arxiv.math/0302172

12 pages

arxiv created 2003/02/14 · arxiv updated 2009/11/30

Abstract

We give a new and short proof of the Mallows-Sloane upper bound for self-dual codes. We formulate a version of Greene's theorem for normalized weight enumerators. We relate normalized rank-generating polynomials to two-variable zeta functions. And we show that a self-dual code has the Clifford property, but that the same property does not hold in general for formally self-dual codes.

Related

• Zeta functions for formal weight enumerators and an analogue of the Mallows-Sloane bound
• Self-Dual Codes better than the Gilbert--Varshamov bound
• Rank-Metric Codes, Generalized Binomial Moments and their Zeta Functions
• Transitive and Self-dual Codes Attaining the Tsfasman-Vladut-Zink Bound
• Construction of divisible formal weight enumerators and extremal polynomials not satisfying the Riemann hypothesis