arXiv subjects
Publications and source records attributed to Iwan Duursma.
Let X be a curve over the finite field of q elements and let N(X), g(X) be its number of rational points and genus respectively. The Ihara constant A(q) is defined by the limit superior of N(X)/g(X) as the genus of X goes to infinity. In this paper, we employ a variant of Serre's class field tower method to obtain an improvement of the best known lower bounds on A(2) and A(3).
We give the parameters of any evaluation code on a smooth quadric surface. For hyperbolic quadrics the approach uses elementary results on product codes and the parameters of codes on elliptic quadrics are obtained by detecting a BCH structure of these codes and using the BCH bound. The elliptic quadric is a twist of the surface P^1 x P^1 and we detect a similar BCH structure on twists of the Segre embedding of a product of any d copies of the projective line.
We show that the generalized Giulietti-Korchmáros curve is not a Galois subcover of the Hermitian curve over $\mathbb{F}_{q^{2n}}$. This answers a question raised by Garcia, Güneri and Stichtenoth.
One-point codes on the Hermitian curve produce long codes with excellent parameters. Feng and Rao introduced a modified construction that improves the parameters while still using one-point divisors. A separate improvement of the parameters was introduced by Matthews considering the classical construction but with two-point divisors. Those two approaches are combined to describe an elementary construction of two-point improved codes. Upon analysis of their minimum distance and redundancy, it is observed that they improve on the previous constructions for a large range of designed distances.
A curve over the field of two elements with completely decomposable Jacobian is shown to have at most six rational points and genus at most 26. The bounds are sharp. The previous upper bound for the genus was 145. We also show that a curve over the field of $q$ elements with more than $q^{m/2}+1$ rational points has at least one Frobenius angle in the open interval $(π/m,3π/m)$. The proofs make use of the explicit formula method.
Various methods have been used to obtain improvements of the Goppa lower bound for the minimum distance of an algebraic geometric code. The main methods divide into two categories and all but a few of the known bounds are special cases of either the Lundell-McCullough floor bound or the Beelen order bound. The exceptions are recent improvements of the floor bound by Guneri-Stichtenoth-Taskin, and Duursma-Park, and of the order bound by Duursma-Park and Duursma-Kirov. In this paper we provide short proofs for all floor bounds and most order bounds in the setting of the van Lint and Wilson AB method. Moreover, we formulate unifying theorems for order bounds and formulate the DP and DK order bounds as natural but different generalizations of the Feng-Rao bound for one-point codes.
The most successful method to obtain lower bounds for the minimum distance of an algebraic geometric code is the order bound, which generalizes the Feng-Rao bound. We provide a significant extension of the bound that improves the order bounds by Beelen and by Duursma and Park. We include an exhaustive numerical comparison of the different bounds for 10168 two-point codes on the Suzuki curve of genus g=124 over the field of 32 elements. Keywords: algebraic geometric code, order bound, Suzuki curve.
We consider a tower of function fields F_0 < F_1 < ... over a finite field such that every place of every F_i ramified in the tower and the sequence genus(F_i)/[F_i:F_0] has a finite limit. We also construct a tower in which every place ramifies and the sequence N_i/[F_i:F_0] has a positive limit, where N_i is the number of degree-one places of F_i. These towers answer questions posed by Stichtenoth.