How arithmetic and geometry make error correcting codes better
From MaRDI portal
Publication:6380970
arXiv2110.11282MaRDI QIDQ6380970FDOQ6380970
Publication date: 21 October 2021
Abstract: This note completes a talk given at the conference Curves over Finite Fields: past, present and future celebrating the publication the book {em Rational Points on Curves over Finite Fields by J.-P. Serre and organised at Centro de ciencias de Benasque in june 2021. It discusses a part of the history of algebraic geometry codes together with some of their recent applications. A particular focus is done on the "multiplicative" structure of these codes, i.e. their behaviour with respect to the component wise product. Some open questions are raised and discussed.
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Arithmetic varieties and schemes; Arakelov theory; heights (14G40) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
This page was built for publication: How arithmetic and geometry make error correcting codes better
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6380970)
