Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities

• Sivakanth Gopi ,
• Venkatesan Guruswami ,
• Sergey Yekhanin

Symposium on Discrete Algorithms (SODA) 2019 | January 2019