Venkata Gandikota, Elena Grigorescu, Clayton Thomas, Minshen Zhu. Maximally recoverable codes: The bounded case. In 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017, Monticello, IL, USA, October 3-6, 2017. pages 1115-1122, IEEE, 2017. [doi]
@inproceedings{GandikotaGTZ17,
title = {Maximally recoverable codes: The bounded case},
author = {Venkata Gandikota and Elena Grigorescu and Clayton Thomas and Minshen Zhu},
year = {2017},
doi = {10.1109/ALLERTON.2017.8262862},
url = {https://doi.org/10.1109/ALLERTON.2017.8262862},
researchr = {https://researchr.org/publication/GandikotaGTZ17},
cites = {0},
citedby = {0},
pages = {1115-1122},
booktitle = {55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017, Monticello, IL, USA, October 3-6, 2017},
publisher = {IEEE},
isbn = {978-1-5386-3266-6},
}