Results on zeta functions for codes

Simple item page
dc.creatorDuursma, I. M.
dc.date2003-02-14
dc.date.accessioned2026-07-07T08:18:12Z
dc.date.available2026-07-07T08:18:12Z
dc.descriptionWe 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.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/math/0302172
dc.identifierhttp://arxiv.org/abs/math/0302172
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134352
dc.subjectCombinatorics
dc.subjectInformation Theory
dc.subjectNumber Theory
dc.subject05B35; 14G15; 94B65
dc.titleResults on zeta functions for codes
dc.typetext

Files

Collections

arXiv