Journal Article
Maximally recoverable LRCs: A field size lower bound and constructions for few heavy parities
Maximally recoverable LRCs: A field size lower bound and constructions for few heavy parities
Polynomial Time Decodable Codes for the Binary Deletion Channel
Approximating Operator Norms via Generalized Krivine Rounding
Efficient Low-Redundancy Codes for Correcting Multiple Deletions
Explicit optimal-length locally repairable codes of distance 5
MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth