Motivated by large-scale storage problems around data loss, a budding branch of coding theory has surfaced in the last decade or so, centered around locally recoverable codes. A code is a subset of a finite-dimensional vector space over a finite field, chosen carefully so that all its elements are locally isolated, as if they were « repelling » each other. Each vector in a code is called a code word. Locally recoverable codes have the property that individual entries in a code word are functions of other entries in the same word. If an entry is accidentally lost, it can be recomputed, and hence a code word can be repaired. Algebraic geometry has a role to play in the design of codes with locality properties. In this talk I will explain how to use algebraic surfaces to both reinterpret constructions of optimal codes already found in the literature, and to find new locally recoverable codes, many of which are optimal.
- Algèbre et géométrie
- Séminaire Raconte-moi