Related papers: Explicit Construction of AG Codes from Generalized…
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…
We present new constructions of quasi-cyclic (QC) and generalized quasi-cyclic (GQC) codes from algebraic curves. Unlike previous approaches based on elliptic curves, our method applies to curves that are Kummer extensions of the rational…
We compute the code parameters for binary linear codes obtained by greedy constructing the parity check matrix. Then we show that these codes improve the Gilbert-Varshamov (GV) bound on the code size and rate. This result counter proves the…
We generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya Cab curves proposed by Lee, Bras-Amor\'os and O'Sullivan (2012) to general one-point AG codes, without any assumption. We also extend their unique…
A curve attaining the Hasse-Weil bound is called a maximal curve. Usually classical error-correcting codes obtained from a maximal curve have good parameters. However, the quantum stabilizer codes obtained from such classical…
We prove a new bound for the minimum distance of geometric Goppa codes that generalizes two previous improved bounds. We include examples of the bound to one and two point codes over both the Suzuki and Hermitian curves.
Cumulative weight enumerators of random linear codes are introduced, their asymptotic properties are studied, and very sharp thresholds are exhibited; as a consequence, it is shown that the asymptotic Gilbert-Varshamov bound is a very sharp…
Computation of Gauss's arithmetic-geometric mean involves iteration of a simple step, whose algebro-geometric interpretation is the construction of an elliptic curve isogenous to a given one, specifically one whose period is double the…
ATR points were introduced by Darmon as a conjectural construction of algebraic points on certain elliptic curves for which in general the Heegner point method is not available. So far the only numerical evidence, provided by Darmon--Logan…
In this paper, we study some codes of algebraic geometry related to certain maximal curves. Quantum stabilizer codes obtained through the self orthogonality of Hermitian codes of this error correcting do not always have good parameters.…
We define and investigate extension groups in the context of Arakelov geometry. The 'arithmetic extension groups' we introduce are extensions by groups of analytic types of the usual extension groups attached to $\O_X$-modules over an…
We give a self-contained survey of some approaches aimed at a global description of the geometry underlying double field theory. After reviewing the geometry of Courant algebroids and their incarnations in the AKSZ construction, we develop…
Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper we elaborate on the implication of these parameters and we devise a method to estimate…
In this note we consider certain elliptic curves defined over real quadratic fields isogenous to their Galois conjugate. We give a construction of algebraic points on these curves defined over almost totally real number fields. The main…
There is a nice combinatorial formula of P. Beelen and M. Datta for the $r$-th generalized Hamming weight of an affine cartesian code. Using this combinatorial formula we give an easy to evaluate formula to compute the $r$-th generalized…
We study the Hermitian hull of a particular family of generalized Reed-Solomon codes. The problem of computing the dimension of the hull is translated to a counting problem in a lattice. By solving this problem, we provide explicit formulas…
We study geometric structures arising from Hermitian forms on linear spaces over real algebras beyond the division ones. Our focus is on the dual numbers, the split-complex numbers, and the split-quaternions. The corresponding geometric…
We show that most arithmetic circuit lower bounds and relations between lower bounds naturally fit into the representation-theoretic framework suggested by geometric complexity theory (GCT), including: the partial derivatives technique…
In this paper, we investigate two-point Algebraic Geometry codes associated to the Skabelund maximal curve constructed as a cyclic cover of the Suzuki curve. In order to estimate the minimum distance of such codes, we make use of the…
The Gilbert--Varshamov (GV) bound is a classical existential result in coding theory. It implies that a random linear binary code of rate $\epsilon^2$ has relative distance at least $\frac{1}{2} - O(\epsilon)$ with high probability.…