Maximally recoverable LRCs: A field size lower bound and constructions for few heavy parities
Published in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2019
Journal version: IEEE Transactions on Information Theory, 2020
Recommended citation: Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin, "Maximally recoverable LRCs: A field size lower bound and constructions for few heavy parities." Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2019.
Download Paper