Related papers: Algebraic Geometric codes on minimal Hirzebruch su…
In this paper, we give an explicit form for the dual of the algebraic geometry code $C_e(a,b)$ defined on an Hirzebruch surface $\mathcal{H}_e$ and parametrized by the divisor $aS_e + bF_e$, where $a,b\in\mathbb{N}$ and $S_e$ and $F_e$…
Let $X$ be a rational surface obtained by blowing up at a configuration $\mathcal{C}$ of infinitely near points over a Hirzebruch surface $\mathbb{F}_\delta$. We prove that there exist two positive integers $a \leq b$ such that the cone of…
In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…
In this article, the minimum distance of the dual $C^{\bot}$ of a functional code $C$ on an arbitrary dimensional variety $X$ over a finite field $\F_q$ is studied. The approach consists in finding minimal configurations of points on $X$…
For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A-C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a…
We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…
We introduce the first geometric construction of codes in the sum-rank metric, which we called linearized Algebraic Geometry codes, using quotients of the ring of Ore polynomials with coefficients in the function field of an algebraic…
Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…
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 prove lower bounds for the minimum distance of algebraic geometry codes over surfaces whose canonical divisor is either nef or anti-strictly nef and over surfaces without irreducible curves of small genus. We sharpen these lower bounds…
Let $X$ be a complete simplicial toric variety over a finite field with a split torus $T_X$. For any matrix $Q$, we are interested in the subgroup $Y_Q$ of $T_X$ parameterized by the columns of $Q$. We give an algorithm for obtaining a…
In this paper, we consider the hull of an algebraic geometry code, meaning the intersection of the code and its dual. We demonstrate how codes whose hulls are algebraic geometry codes may be defined using only rational places of Kummer…
We study the functional codes $C_2(X)$ defined on projective varieties $X$, in the case where $X\subset \mathbb{P}^3$ is a 1-degenerate quadric or a non-degenerate quadric (hyperbolic or elliptic). We find the minimum distance of these…
The (abstract) Cuntz algebra is generated by non-unitary isometries and has therefore no intrinsic finiteness properties. To approximate the elements of the Cuntz algebra by finite-dimensional objects, we thus consider a spatial…
We give bounds on the degree of generation and relations of section rings associated to arbitrary $\mathbb{Q}$-divisors on projective spaces of all dimensions and Hirzebruch surfaces. For section rings of effective $\mathbb{Q}$-divisors on…
The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…
This paper is a general survey of literature on Goppa-type codes from higher dimensional algebraic varieties. The construction and several techniques for estimating the minimum distance are described first. Codes from various classes of…
An anticode ${\bf C} \subset {\bf F}_q^n$ with the diameter $\delta$ is a code in ${\bf F}_q^n$ such that the distance between any two distinct codewords in ${\bf C}$ is at most $\delta$. The famous Erd\"{o}s-Kleitman bound for a binary…
Chara et al. introduced conorm codes defined over algebraic geometry codes, but the hulls of conorm codes were not determined yet. In this paper, we study the dimension of the hull of conorm codes using the method introduced by Camps et al.…
We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined over finite fields. We give a general bound on their minimum distance and we investigate how this estimation can be sharpened under the…