Maximally Recoverable Codes for Grid-like Topologies

DOI10.1137/1.9781611974782.136zbMath1409.68092arXiv1605.05412OpenAlexW2405991429MaRDI QIDQ4575884

Sergey Yekhanin, Swastik Kopparty, Parikshit Gopalan, Carol J. Wang, Guang-Da Hu, Shubhangi Saraf

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20) Distributed systems (68M14)

Related Items (7)

New bounds on the field size for maximally recoverable codes instantiating grid-like topologies ⋮ Unnamed Item ⋮ The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes ⋮ Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture ⋮ Rank-Metric Codes and Their Applications ⋮ Codes for Distributed Storage ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications

This page was built for publication: Maximally Recoverable Codes for Grid-like Topologies