Related papers: Codes from surfaces with small Picard number
In this note, we give a construction of codes on algebraic function field $F/ \mathbb{F}_{q}$ using places of $F$ (not necessarily of degree one) and trace functions from various extensions of $\mathbb{F}_{q}$. This is a generalization of…
In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PG-LDPC) codes, that are constructed based on the projective planes PG{2,q). In particular, we study…
We define the over-exceptional lattice of a minimal algebraic surface of Kodaira dimension 0. Bounding the rank of this object, we prove that a conjecture by Campana and Corvaja--Zannier holds for Enriques surfaces, as well as K3 surfaces…
A new class of examples of surfaces with maximal Picard number is constructed. These carry pencils of genus two or three curves such their Jacobian fibrations are isogenous to fibre products of elliptic modular surfaces.
This paper characterizes Goppa codes of certain maximal curves over finite fields defined by equations of the form $y^n = x^m + x$. We investigate Algebraic Geometric and quantum stabilizer codes associated with these maximal curves and…
We construct algebraic geometric codes from del Pezzo surfaces and focus on the ones having Picard rank one and the codes associated to the anticanonical class. We give explicit constructions of del Pezzo surfaces of degree 4, 5 and 6,…
We will give a criterion to assure that an extremal contraction of a K3 surface which is not a Mori Dream Space produces a singular surface which is a Mori Dream Spaces. We list the possible N\'eron--Severi groups of K3 surfaces with this…
We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult…
We introduce \emph{hierarchical depth}, a new invariant of line bundles and divisors, defined via maximal chains of effective sub-line bundles. This notion gives rise to \emph{hierarchical filtrations}, refining the structure of the Picard…
Examples of algebraic surfaces of general type with maximal Picard number are not abundant in the literature. Moreover, most known examples either possess low invariants, lie near the Noether line $K^2=2\chi-6$ or are somewhat scattered. A…
In this paper we study evaluation codes arising from plane quotients of the Hermitian curve, defined by affine equations of the form $y^q+y=x^m$, $q$ being a prime power and $m$ a positive integer which divides $q+1$. The dual minimum…
We give an algorithm that takes a smooth hypersurface over a number field and computes a $p$-adic approximation of the obstruction map on the Tate classes of a finite reduction. This gives an upper bound on the "middle Picard number" of the…
Let S be a smooth, projective surface of Picard rank 1 and very ample generator embedding S into P^n. Let C be a smooth curve in O(m) for m \geq 5. We prove that any base-point free, complete g^r_d on C for r\in\{1,2\} and d small enough is…
Let $S$ be a certain affine algebraic surface over $\mathbb{Q}$ such that it admits a regular map to $\mathbb{A}^2/\mathbb{Q}$. We show that any non-trivial torsion line bundle in the relative Picard group $Pic^0\left(S/\mathbb{A}^2\right)$…
We introduce a new construction of error-correcting codes from algebraic curves over finite fields. Modular curves of genus g -> infty over a field of size q0^2 yield nonlinear codes more efficient than the linear Goppa codes obtained from…
According to their strength, the tracing properties of a code can be categorized as frameproof, separating, IPP and TA. It is known that if the minimum distance of the code is larger than a certain threshold then the TA property implies the…
Computing the minimum distance of a linear code is one of the fundamental problems in algorithmic coding theory. Vardy [14] showed that it is an \np-hard problem for general linear codes. In practice, one often uses codes with additional…
In this article, we construct codes with hierarchical locality using natural geometric structures in Artin-Schreier surfaces of the form $y^p-y=f(x,z)$. Our main theorem describes the codes, their hierarchical structure and recovery…
In this paper, we give a geometric characterization of minimal linear codes. In particular, we relate minimal linear codes to cutting blocking sets, introduced in a recent paper by Bonini and Borello. Using this characterization, we derive…
We study a construction, which produces surfaces $Y \subset P_3$ with cusps. For example we obtain surfaces of degree six with 18, 24 or 27 three-divisible cusps. For sextic surfaces in a particular family of up to 30 cusps the codes of…