Maximally Recoverable Codes for Grid-like Topologies - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Parikshit Gopalan' in GoogleThis author has not been identified. Look up 'Guangda Hu' in GoogleThis author has not been identified. Look up 'Swastik Kopparty' in GoogleThis author has not been identified. Look up 'Shubhangi Saraf' in GoogleThis author has not been identified. Look up 'Carol Wang' in GoogleThis author has not been identified. Look up 'Sergey Yekhanin' in Google

runs on WebDSL