English
Related papers

Related papers: Bases for Riemann--Roch spaces of linearized funct…

200 papers

The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance…

Information Theory · Computer Science 2010-11-04 Olav Geil , Carlos Munuera , Diego Ruano , Fernando Torres

For applications in algebraic geometric codes, an explicit description of bases of Riemann-Roch spaces of divisors on function fields over finite fields is needed. We give an algorithm to compute such bases for one point divisors, and…

Number Theory · Mathematics 2011-07-01 Francesco Noseda , Gilvan Oliveira , Luciane Quoos

We introduce the first geometric construction of codes in the sum-rank metric, which we called linearized Algebraic Geometry codes, using quotients of the ring of Ore polynomials with coefficients in the function field of an algebraic…

Algebraic Geometry · Mathematics 2024-05-30 Elena Berardini , Xavier Caruso

The Riemann-Roch theorem is of utmost importance in the algebraic geometric theory of compact Riemann surfaces. It tells us how many linearly independent meromorphic functions there are having certain restrictions on their poles. The aim of…

Complex Variables · Mathematics 2007-06-20 A. Lesfari

We introduce and study the minimum distance function of a graded ideal in a polynomial ring with coefficients in a field, and show that it generalizes the minimum distance of projective Reed-Muller-type codes over finite fields. This gives…

Commutative Algebra · Mathematics 2018-10-19 Jose Martinez-Bernal , Yuriko Pitones , Rafael H. Villarreal

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…

Information Theory · Computer Science 2021-04-01 Yves Aubry , Elena Berardini , Fabien Herbaut , Marc Perret

In this paper, we provide conditions that hulls of generalized Reed-Solomon (GRS) codes are also GRS codes from algebraic geometry codes. If the conditions are not satisfied, we provide a method of linear algebra to find the bases of hulls…

Information Theory · Computer Science 2024-01-25 Xue Jia , Qin Yue , Huan Sun , Junzhen Sui

In this paper we introduce the relative generalized minimum distance function (RGMDF for short) and it allows us to give an algebraic approach to the relative generalized Hamming weights of the projective Reed--Muller--type codes. Also we…

Commutative Algebra · Mathematics 2021-04-21 Manuel Gonzalez Sarabia , Miguel E. Uribe-paczka , Eliseo Sarmiento , Carlos Renteria

We construct linear network codes utilizing algebraic curves over finite fields and certain associated Riemann-Roch spaces and present methods to obtain their parameters. In particular we treat the Hermitian curve and the curves associated…

Information Theory · Computer Science 2015-03-10 Johan P. Hansen

This note presents some new information on how the minimum distance of the generalized toric code corresponding to a fixed set of integer lattice points S in R^2 varies with the base field. The main results show that in some cases, over…

Information Theory · Computer Science 2011-09-14 John B. Little

This paper introduces new constructions of sum-rank metric codes derived from algebraic function fields, as existing results on such codes remain limited. A major challenge lies in the determination of their parameters. We address this…

Information Theory · Computer Science 2025-12-16 Zhu Yunlong , Zhao Chang-An

We design a polynomial time decoding algorithm for linearized Algebraic Geometry codes with unramified evaluation places, a family of sum-rank metric evaluation codes on division algebras over function fields. By establishing a Serre…

Information Theory · Computer Science 2026-03-13 Elena Berardini , Xavier Caruso , Fabrice Drain

We prove lower bounds for the minimum distance of algebraic geometry codes over surfaces whose canonical divisor is either nef or anti-strictly nef and over surfaces without irreducible curves of small genus. We sharpen these lower bounds…

Algebraic Geometry · Mathematics 2020-03-04 Yves Aubry , Elena Berardini , Fabien Herbaut , Marc Perret

We introduce a linear programming method to obtain bounds on the cardinality of codes in Grassmannian spaces for the chordal distance. We obtain explicit bounds, and an asymptotic bound that improves on the Hamming bound. Our approach…

Combinatorics · Mathematics 2016-11-18 Christine Bachoc

This paper develops the geometry of locally bounded rational functions on non-singular real algebraic varieties. First various basic geometric and algebraic results regarding these functions are established in any dimension, culminating…

Algebraic Geometry · Mathematics 2024-10-15 Victor Delage , Goulwen Fichou , Aftab Patel

Geometric characteristics of metric spaces that appear in formulas of the Gromov--Hausdorff distances from these spaces to so-called simplexes, i.e., to the metric spaces, all whose non-zero distances are the same are studied. The…

Metric Geometry · Mathematics 2019-06-25 D. S. Grigor'ev , A. O. Ivanov , A. A. Tuzhilin

For an (imaginary) hyperelliptic curve $\mathcal{H}$ of genus $g$, we determine a basis of the Riemann-Roch space $\mathcal{L}(D)$, where $D$ is a divisor with positive degree $n$, linearly equivalent to $P_1+\cdots+ P_j+(n-j)\Omega$, with…

Algebraic Geometry · Mathematics 2020-12-17 Giovanni Falcone , Ágota Figula , Carolin Hannusch

We define a class of automorphisms of rational function fields of finite characteristic and employ these to construct different types of optimal linear rank-metric codes. The first construction is of generalized Gabidulin codes over…

Information Theory · Computer Science 2021-08-30 Rakhi Pratihar , Tovohery Hajatiana Randrianarisoa

In this note, we provide a description of the elements of minimum rank of a generalized Gabidulin code in terms of Grassmann coordinates. As a consequence, a characterization of linearized polynomials of rank at most $n-k$ is obtained, as…

Information Theory · Computer Science 2022-03-15 Luca Giuzzi , Guglielmo Lunardon

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…

Information Theory · Computer Science 2021-04-15 Nupur Patanker , Sanjay Kumar Singh
‹ Prev 1 2 3 10 Next ›