A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures

S. B. Balaji, Ganesh R. Kini, P. Vijay Kumar. A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures. In 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017. pages 1778-1782, IEEE, 2017. [doi]

Abstract

Abstract is missing.