Trial lecture: Kolmogorov complexity and cryptography

05.05.2023
, 2:00 pm
All events

A family of erasure correcting codes with low repair bandwidth and low repair complexity

  • S. Kumar, A. Graell i Amat, I. Andriyanova, and F. Brännström, “A family of erasure correcting codes with low repair bandwidth and low repair complexity” in Proc. IEEE Global Telecommun. Conf. (GLOBECOM), San Diego, CA, USA, Dec. 2015