680 research outputs found
Results on zeta functions for codes
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.Comment: 12 page
Finite Fields: Theory and Applications
Finite fields are the focal point of many interesting geometric, algorithmic and combinatorial problems. The workshop was devoted to progress on these questions, with an eye also on the important applications of finite field techniques in cryptography, error correcting codes, and random number generation
- …