Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin. Maximally Recoverable Codes for Grid-like Topologies. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. pages 2092-2108, SIAM, 2017. [doi]
@inproceedings{GopalanHKSWY17,
title = {Maximally Recoverable Codes for Grid-like Topologies},
author = {Parikshit Gopalan and Guangda Hu and Swastik Kopparty and Shubhangi Saraf and Carol Wang and Sergey Yekhanin},
year = {2017},
doi = {10.1137/1.9781611974782.136},
url = {http://dx.doi.org/10.1137/1.9781611974782.136},
researchr = {https://researchr.org/publication/GopalanHKSWY17},
cites = {0},
citedby = {0},
pages = {2092-2108},
booktitle = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19},
editor = {Philip N. Klein},
publisher = {SIAM},
isbn = {978-1-61197-478-2},
}