S. B. Balaji, Ganesh R. Kini, P. Vijay Kumar. A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures. In 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017. pages 1778-1782, IEEE, 2017. [doi]
@inproceedings{BalajiKK17,
title = {A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures},
author = {S. B. Balaji and Ganesh R. Kini and P. Vijay Kumar},
year = {2017},
doi = {10.1109/ISIT.2017.8006835},
url = {https://doi.org/10.1109/ISIT.2017.8006835},
researchr = {https://researchr.org/publication/BalajiKK17},
cites = {0},
citedby = {0},
pages = {1778-1782},
booktitle = {2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017},
publisher = {IEEE},
isbn = {978-1-5090-4096-4},
}