Related papers: Construction of Rational Surfaces Yielding Good Co…
The surface code is a prominent topological error-correcting code exhibiting high fault-tolerance accuracy thresholds. Conventional schemes for error correction with the surface code place qubits on a planar grid and assume native CNOT…
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,…
In the first part of this article, we consider ruled surfaces defined over a finite field; we introduce invariants for them, and describe some explicit contructions that illustrate possible behaviour of these invariants. In the second part,…
Motivated by a recent question of Peyre, we apply the Hardy-Littlewood circle method to count "sufficiently free" rational points of bounded height on arbitrary smooth projective hypersurfaces of low degree that are defined over the…
Richard Guy asked for the largest set of points which can be placed in the plane so that their pairwise distances are rational numbers. In this article, we consider such a set of rational points restricted to a given hyperbola. To be…
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the…
The surface code is a quantum error-correcting code for one logical qubit, protected by spatially localized parity checks in two dimensions. Due to fundamental constraints from spatial locality, storing more logical qubits requires either…
The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum…
In recent years, many useful applications of the polynomial method have emerged in finite geometry. Indeed, algebraic curves, especially those defined by R\'edei-type polynomials, are powerful in studying blocking sets. In this paper, we…
We study the algebraic geometry of a family of evaluation codes from plane smooth curves defined over any field. In particular, we provide a cohomological characterization of their dual minimum distance. After having discussed some general…
A rational triangle is a triangle with rational sides and rational area. A Heron triangle is a triangle with integral sides and integral area. In this article we will show that there exist infinitely many rational parametrizations, in terms…
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…
The aim of this article is to give lower bounds on the parameters of algebraic geometric error-correcting codes constructed from projective bundles over Deligne--Lusztig surfaces. The methods based on an intensive use of the intersection…
Various methods have been used to construct rational points and rational curves on rationally connected algebraic varieties. We survey recent advances in two of them, the descent and the fibration method, in a number-theoretical context…
In this paper, we give a uniform upper bound on the rational points of bounded height provided by conics in a cubic surface. For this target, we give a generalized version of the global determinant method of Salberger by Arakelov geometry.
The surface code scheme for quantum computation features a 2d array of nearest-neighbor coupled qubits yet claims a threshold error rate approaching 1% (NJoP 9:199, 2007). This result was obtained for the toric code, from which the surface…
It is proved that a smooth rational surface in projective four-space, which is ruled by cubics or quartics has degree at most 12. It is also proved that a smooth rational surface in projective four-space which is the image of Fn by a linear…
We describe two different approaches to making systematic classifications of plane lattice polygons, and recover the toric codes they generate, over small fields, where these match or exceed the best known minimum distance. This includes a…
This is a first graduate course in algebraic geometry. It aims to give the student a lift up into the subject at the research level, with lots of interesting topics taken from the classification of surfaces, and a human-oriented discussion…
It is well known that an irreducible algebraic curve is rational (i.e. parametric) if and only if its genus is zero. In this paper, given a tolerance $\epsilon>0$ and an $\epsilon$-irreducible algebraic affine plane curve $\mathcal C$ of…