14 research outputs found
Some new results on the self-dual [120,60,24] code
The existence of an extremal self-dual binary linear code of length 120 is a
long-standing open problem. We continue the investigation of its automorphism
group, proving that automorphisms of order 30 and 57 cannot occur. Supposing
the involutions acting fixed point freely, we show that also automorphisms of
order 8 cannot occur and the automorphism group is of order at most 120, with
further restrictions. Finally, we present some necessary conditions for the
existence of the code, based on shadow and design theory.Comment: 23 pages, 6 tables, to appear in Finite Fields and Their Application
A Riemann hypothesis analogue for invariant rings
AbstractA Riemann hypothesis analogue for coding theory was introduced by I.M. Duursma [A Riemann hypothesis analogue for self-dual codes, in: A. Barg, S. Litsyn (Eds.), Codes and Association Schemes (Piscataway, NJ, 1999), American Mathematical Society, Providence, RI, 2001, pp. 115–124]. In this paper, we extend zeta polynomials for linear codes to ones for invariant rings, and we investigate whether a Riemann hypothesis analogue holds for some concrete invariant rings. Also we shall show that there is some subring of an invariant ring such that the subring is not an invariant ring but extremal polynomials all satisfy the Riemann hypothesis analogue