相关论文: AG codes on certain maximal curves
We introduce new yet easily accessible codes for elements of $GL_r(A)$ with $A$ the adelic ring of a (dimension one) function field over a finite field. They are linear codes, and coincide with classical algebraic geometry codes when $r=1$.…
In this paper we prove the topological uniqueness of maximal arrangements of a real plane algebraic curve with respect to three lines. More generally, we prove the topological uniqueness of a maximally arranged algebraic curve on a real…
Graph colorings are becoming an increasingly useful family of mathematical models for a broad range of applications, such as time tabling and scheduling, frequency assignment, register allocation, computer security and so on. Graph proper…
We investigate the Jacobian decomposition of some algebraic curves over finite fields with genus $4$, $5$ and $10$. As a corollary, explicit equations for curves that are either maximal or minimal over the finite field with $p^2$ elements…
In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…
We introduce Graphical Algebraic Geometry (GAG), a family of diagrammatic languages extending the Graphical Linear Algebra programme. We construct several languages within this family and prove that they are universal and complete for the…
This work builds on earlier work of the first three authors where a notion of congruence modules in higher codimension is introduced. The main new results are a criterion for detecting regularity of local rings in terms of congruence…
We give a classification of all possible $2$-adic images of Galois representations associated to elliptic curves over $\mathbb{Q}$. To this end, we compute the 'arithmetically maximal' tower of 2-power level modular curves, develop…
In this paper, we continue the study of Maximally Recoverable (MR) Grid Codes initiated by Gopalan et al. [SODA 2017]. More precisely, we study codes over an $m \times n$ grid topology with one parity check per row and column of the grid…
The concept of geometric-arithmetic index was introduced in the chemical graph theory recently, but it has shown to be useful. The aim of this paper is to obtain new inequalities involving the geometric-arithmetic index $GA_1$ and…
In this paper, Algebraic-Geometric (AG) codes and quantum codes associated to a family of curves which comprises the famous Suzuki curve are investigated. The Weierstrass semigroup at some rational point is computed. Notably, each curve in…
We extend the construction of GAG codes to the case of evaluation codes. We estimate the minimum distance of these extended evaluation codes and we describe the connection to the one-point GAG codes.
We reformulate a recently introduced interpolation-based unique decoding algorithm of algebraic geometry codes using the theory of Gr\"obner bases of modules on the coordinate ring of the base curve. With the same decoding performance, the…
We suggest a new approach to obtain bounds on locally correctable and some locally testable binary linear codes, by arguing that these codes (or their subcodes) have coset leader graphs with high discrete Ricci curvature. The bounds we…
Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the underlying LP problem. In this paper, we…
New infinite families of quantum symmetric and asymmetric codes are constructed. Several of these are MDS. The codes obtained are shown to have parameters which are better than previously known. A number of known codes are special cases of…
Rapid advancements in machine learning (ML) are transforming materials science by significantly speeding up material property calculations. However, the proliferation of ML approaches has made it challenging for scientists to keep up with…
A novel and deterministic algorithm is presented to detect whether two given rational plane curves are related by means of a similarity, which is a central question in Pattern Recognition. As a by-product it finds all such similarities, and…
Many classical results in algebraic geometry arise from investigating some extremal behaviors that appear among projective varieties not lying on any hypersurface of fixed degree. We study two numerical invariants attached to such…
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic…