A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures

DOI10.1109/TIT.2019.2958970zbMath1434.94082arXiv1611.08561OpenAlexW2996607502MaRDI QIDQ5211651

P. Vijay Kumar, S. B. Balaji, Ganesh R. Kini

Publication date: 28 January 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.08561

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (1)

Codes for Distributed Storage

This page was built for publication: A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures