Related papers: Codes from surfaces with small Picard number
We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by…
The Severi variety $V_{d,n}$ of plane curves of a given degree $d$ and exactly $n$ nodes admits a map to the Hilbert scheme $\mathbb{P}^{2[n]}$ of zero-dimensional subschemes of $\mathbb{P}^2$ of degree $n$. This map assigns to every curve…
We consider a rational surface with a relatively minimal fibration. Picard number of a such fibred surface is bounded in terms of the genus of a general fibre. When Picard number is the maximum for any given genus, we characterize a such…
In this paper we introduce a new type of code, called projective nested cartesian code. It is obtained by the evaluation of homogeneous polynomials of a fixed degree on a certain subset of $\mathbb{P}^n(\mathbb{F}_q)$, and they may be seen…
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at most 1 from x. The problem of finding an identifying code of…
The simple interpretation of the minimum distance of a linear code obtained by De Boer and Pellikaan, and later refined by the second author, is further developed through the study of various finitely generated graded modules. We use the…
Current work presents a new approach to quantum color codes on compact surfaces with genus $g \geq 2$ using the identification of these surfaces with hyperbolic polygons and hyperbolic tessellations. We show that this method may give rise…
Linear constraints for a matrix polytope with no fractional vertex are investigated as intersecting research among permutation codes, rank modulations, and linear programming methods. By focusing the discussion to the block structure of…
Algebraic-geometric codes can be constructed by evaluating a certain set of functions on a set of distinct rational points of an algebraic curve. The set of functions that are evaluated is the linear space of a given divisor or,…
Some linear codes associated to maximal algebraic curves via Feng-Rao construction are investigated. In several case, these codes have better minimum distance with respect to the previously known linear codes with same length and dimension.
We define a new class of Convolutional Codes in terms of fibrations of algebraic varieties generalizaing our previous constructions of Convolutional Goppa Codes. Using this general construction we can give several examples of Maximum…
Motivated by an application to LDPC (low density parity check) algebraic geometry codes described by Voloch and Zarzar, we describe a computational procedure for establishing an upper bound on the arithmetic or geometric Picard number of a…
We construct locally recoverable codes with hierarchy from surfaces in $\mathbb{A}^3$ admitting a fibration by curves of Artin-Schreier or Kummer type. We derive the parameters of our codes by leveraging the geometry and arithmetic of the…
A new kind of Convolutional Codes generalizing Goppa Codes is proposed. This provides a systematic method for constructing convolutional codes with prefixed properties. In particular, examples of Maximum-Distance Separable (MDS)…
Hoholdt, van Lint and Pellikaan used order functions to construct codes by means of Linear Algebra and Semigroup Theory only. However, Geometric Goppa codes that can be represented by this method are mainly those based on just one point. In…
In this article we prove that a class of Goppa codes whose Goppa polynomial is of the form $g(x) = x + x^q + \cdots + x^{q^{m-1}}$ where $m \geq 3$ (i.e. $g(x)$ is a trace polynomial from a field extension of degree $m \geq 3$) has a better…
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…
In the first part of this paper we give a survey of classical results on Kummer surfaces with Picard number 17 from the point of view of lattice theory. We prove ampleness properties for certain divisors on Kummer surfaces and we use them…
We describe normal forms and minimal models of Picard curves, discussing various arithmetic aspects of these. We determine all so-called special Picard curves over $\mathbb{Q}$ with good reduction outside 2 and 3, and use this to determine…
In this paper, we first study in detail the relationship between minimal linear codes and cutting blocking sets, which were recently introduced by Bonini and Borello, and then completely characterize minimal linear codes as cutting blocking…