Related papers: Generalized Reed-Muller codes and curves with many…
We consider the general problem of enumerating branched covers of the projective line from a fixed general curve subject to ramification conditions at possibly moving points. Our main computations are in genus 1; the theory of limit linear…
We study generalized covering radii, a fundamental property of linear codes that characterizes the trade-off between storage, latency, and access in linear data-query protocols such as PIR. We prove lower and upper bounds on the generalized…
We investigate complete arcs of degree greater than two, in projective planes over finite fields, arising from the set of rational points of a generalization of the Hermitian curve. The degree of the arcs is closely related to the number of…
Based on two classical notions of curvature for curves in general metric spaces, namely the Menger and Haantjes curvatures, we introduce new definitions of sectional, Ricci and scalar curvature for networks and their higher dimensional…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
We consider the question of determining the higher weights or the generalized Hamming weights of affine Grassmann codes and their duals. Several initial as well as terminal higher weights of affine Grassmann codes of an arbitrary level are…
The Generalized Hamming weights and their relative version, which generalize the minimum distance of a linear code, are relevant to numerous applications, including coding on the wire-tap channel of type II, $t$-resilient functions,…
We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC…
A general type of ray class fields of global function fields is investigated. The systematic computation of their genera leads to new examples of curves over finite fields with comparatively many rational points.
The van der Geer-van der Vlugt curves are Artin-Schreier coverings of the affine line defined by linearized polynomials over finite fields. We give several criteria for them to be maximal or minimal, i.e. attaining the upper or lower bound…
Projective Reed-Muller codes were introduced by Lachaud, in 1988 and their dimension and minimum distance were determined by Serre and S{\o}rensen in 1991. In coding theory one is also interested in the higher Hamming weights, to study the…
Linear codes with a few weights can be applied to communication, consumer electronics and data storage system. In addition, the weight hierarchy of linear codes has many applications such as on the type II wire-tap channel, dealing with…
We generalize a theorem of D. Rohrlich concerning root numbers of elliptic curves over the field of rational numbers. Our result applies to curves of all higher genera over number fields. Namely, under certain conditions which naturally…
Building upon the work of Stucker, Vennos, and Young we derive generalized Dedekind sums arising from period integrals applied to holomorphic Eisenstein series attached to pairs of primitive non-trivial Dirichlet characters. Furthermore, we…
A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…
We give explicit formulas for the number of distinct elliptic curves over a finite field, up to isomorphism, in two families of curves introduced by C.~Doche, T.~Icart and D.~R. Kohel.
We give a combinatorial description of closed curves on oriented surfaces in terms of certain permutations, called charts. We describe automorphisms of curves in terms of charts and compute the total number of curves counted with…
We obtain new results on the existence and multiplicity of fixed points of Hammerstein equations in very general cones. In order to achieve this, we combine a new formulation of cones in terms of continuous functionals with fixed point…