# Toward good families of codes from towers of surfaces

1 GRACE - Geometry, arithmetic, algorithms, codes and encryption
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be "liftable" under finite morphisms, paving the way toward the construction of good codes from towers of surfaces. In the same direction, we establish a criterion for a surface with a fixed finite set of closed points $\mathcal P$ to have an infinite tower of $\ell$-\'etale covers in which $\mathcal P$ splits totally. We conclude by stating several open problems. In particular, we relate the existence of asymptotically good codes from general type surfaces with a very ample canonical class to the behaviour of their number of rational points with respect to their $K^2$ and coherent Euler characteristic.
Document type :
Conference papers
Domain :

https://hal.archives-ouvertes.fr/hal-02470343
Contributor : Alain Couvreur Connect in order to contact the contributor
Submitted on : Friday, February 7, 2020 - 11:18:54 AM
Last modification on : Tuesday, April 5, 2022 - 3:40:33 AM

### Citation

Alain Couvreur, Philippe Lebacque, Marc Perret. Toward good families of codes from towers of surfaces. Arithmetic, Geometry, Cryptography and Coding Theory, Stéphane Ballet, Gaetan Bisson, Irene Bouw, Jun 2019, Marseille, France. ⟨10.1090/conm/770⟩. ⟨hal-02470343⟩

Record views