Sommaire

  • Cet exposé a été présenté le 20 octobre 2017.

Description

  • Orateur

    Everett Howe - Center for Communications Research, San Diego

A locally recoverable code, or LRC, is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. I will explain why LRCs are important for applications such as cloud data storage, and I will present several constructions of locally recoverable codes from Galois covers of curves over finite fields. This is joint work with Alexander Barg, Kathryn Haymaker, Gretchen L. Matthews, and Anthony Várilly-Alvarado.

Prochains exposés

Voir les exposés passés