%0 Conference Paper %1 conf/isit/BalajiKK17 %A Babu, Balaji Srinivasan %A Kini, Ganesh R. %A Kumar, P. Vijay %B ISIT %D 2017 %I IEEE %K dblp %P 1778-1782 %T A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures. %U http://dblp.uni-trier.de/db/conf/isit/isit2017.html#BalajiKK17 %@ 978-1-5090-4096-4

@inproceedings{conf/isit/BalajiKK17, added-at = {2020-01-31T00:00:00.000+0100}, author = {Babu, Balaji Srinivasan and Kini, Ganesh R. and Kumar, P. Vijay}, biburl = {https://www.bibsonomy.org/bibtex/2c450ea20611e33cef8dfd475e445d4f1/dblp}, booktitle = {ISIT}, crossref = {conf/isit/2017}, ee = {https://doi.org/10.1109/ISIT.2017.8006835}, interhash = {f67030c6c8fe239eaaf09c60e6189d25}, intrahash = {c450ea20611e33cef8dfd475e445d4f1}, isbn = {978-1-5090-4096-4}, keywords = {dblp}, pages = {1778-1782}, publisher = {IEEE}, timestamp = {2020-02-01T11:43:19.000+0100}, title = {A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures.}, url = {http://dblp.uni-trier.de/db/conf/isit/isit2017.html#BalajiKK17}, year = 2017 }