Table of contents

  • This session has been presented October 20, 2017.

Description

  • Speaker

    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.

Next sessions

  • TBA

    • September 18, 2026 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Eran Lambooij - Inria

    • Cryptography

  • TBA

    • September 25, 2026 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Anmoal Porwal - Technical University of Munich

    • Cryptography

    • Asymmetric primitive

Show previous sessions
Page top