Related papers: AG codes on certain maximal curves
We study entire holomorphic curves in the algebraic torus, and show that they can be characterized by the ``growth rate'' of their derivatives.
Space filling curves are widely used in Computer Science. In particular Hilbert curves and their generalisations to higher dimension are used as an indexing method because of their nice locality properties. This article generalises this…
Constructions and exploration of plane algebraic curves has received a new push with the development of automated methods, whose algorithms are continuously improved and implemented in various software packages. We use them to explore the…
Tropical geometry is a piecewise linear "shadow" of algebraic geometry. It allows for the computation of several cohomological invariants of an algebraic variety. In particular, its application to enumerative algebraic geometry led to…
Geometric number systems, obtained by extending the real number system to include new anticommuting square roots of +1 and -1, provide a royal road to higher mathematics by largely sidestepping the tedious languages of tensor analysis and…
The purpose of the present article is the study of duals of functional codes on algebraic surfaces. We give a direct geometrical description of them, using differentials. Even if this geometrical description is less trivial, it can be…
We study the Betti tables of reducible algebraic curves with a focus on connected line arrangements and provide a general formula for computing the quadratic strand of the Betti table for line arrangements that satisfy certain hypotheses.…
Rational algebraic curves have been intensively studied in the last decades, both from the theoretical and applied point of view. In applications (e.g. level curves, linear homotopy deformation, geometric constructions in computer aided…
The genus of a maximal curve over a finite field with r^2 elements is either g_0=r(r-1)/2 or less than or equal to g_1=(r-1)^2/4. Maximal curves with genus g_0 or g_1 have been characterized up to isomorphism. A natural genus to be studied…
The class of 1-generator quasi-abelian codes over finite fields is revisited. Alternative and explicit characterization and enumeration of such codes are given. An algorithm to find all 1-generator quasi-abelian codes is provided. Two…
One of the most important and challenging problems in coding theory is to construct codes with best possible parameters and properties. The class of quasi-cyclic (QC) codes is known to be fertile to produce such codes. Focusing on QC codes…
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic problems of a code. While these problems are known to be hard for…
We improve recent results relating graph eigenvalues to other graph parameters like girth, domination number, and minimum degree.
In this paper, an algorithm to compute a certified $G^1$ rational parametric approximation for algebraic space curves is given by extending the local generic position method for solving zero dimensional polynomial equation systems to the…
In recent years a series of remarkable advances in tropical geometry and in non-archimedean geometry have brought new insights to the moduli theory of algebraic curves and their Jacobians. The goal of this survey, an expanded version of my…
We present a unique decoding algorithm of algebraic geometry codes on plane curves, Hermitian codes in particular, from an interpolation point of view. The algorithm successfully corrects errors of weight up to half of the order bound on…
The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph $H$ of a given graph $G$ such that $H$ has maximum edge cardinality. For more than two decades, the only known non-trivial exact algorithm was based on integer linear…
We consider the problem of answering connectivity queries on a real algebraic curve. The curve is given as the real trace of an algebraic curve, assumed to be in generic position, and being defined by some rational parametrizations. The…
Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…
In this paper we provide the non-existence criterion for the so-called maximizing curves of odd degrees. Furthermore, in the light of our criterion, we define a new class of plane curves that generalizes the notion of maximizing curves…