Algèbre et géométrie

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, […]