A closed formula is given for the Tate pairing on the hyperelliptic curve y 2 = x p – x + d in characteristic p in order to improve the implementations in [BKLS02], [GHS02] for the special case p=3.Expand

We show how to speed up the discrete log computations on curves having automorphisms of large order, thus generalizing the attacks on anomalous binary elliptic curves. This includes the first known… Expand

An upper bound for the minimum distance of a divisible code in terms of its dual distance is established and the zeta function of a quaternary extremal self-dual code has its zeros on the circle |T|=q^-^1^/^2 in analogy with the zets of an algebraic curve.Expand

A majority coset decoding (MCD) procedure that can be applied to an arbitrary geometric code is discussed and a strictly smaller cost containing the error vector is obtained.Expand

A single erasure repair method for RS codes that achieves the optimal repair bandwidth amongst all linear encoding schemes is proposed and the trace collection technique is extended to cope with two and three erasures.Expand

The in general hard problem of computing weight distributions of linear codes is considered for the special class of algebraic-geometric codes, defined by Goppa in the early eighties. Known results… Expand

We develop efficient algorithms for the Jacobian of the hyperelliptic curve defined by the equation y2=xp-x+1 over a finite field F p n of odd characteristic p. We first determine the zeta function… Expand

The rank polynomial of a matroid is considered and some well-known applications to graphs and linear codes are mentioned, and a relation for algebraic-geometric codes between the matroid of a code and the two-variable zeta function of a curve is compared.Expand

A general decoding method for linear codes is investigated for cyclic codes, and a new family of codes is given for which the decoding needs only O(n/sup 2/) operations.Expand