Duality and decoding of linearized Algebraic Geometry codes
Information Theory
2026-03-13 v1 Algebraic Geometry
math.IT
Abstract
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 duality and a Riemann-Roch theorem for these algebras, we prove that the dual codes of such linearized Algebraic Geometry codes, that we term linearized Differential codes, coincide with the linearized Algebraic Geometry codes themselves over the adjoint algebra, and that our decoding algorithm is correct.
Cite
@article{arxiv.2603.11826,
title = {Duality and decoding of linearized Algebraic Geometry codes},
author = {Elena Berardini and Xavier Caruso and Fabrice Drain},
journal= {arXiv preprint arXiv:2603.11826},
year = {2026}
}