BibTeX record conf/isit/BalajiKK17

download as .bib file

@inproceedings{DBLP:conf/isit/BalajiKK17,
  author       = {Balaji Srinivasan Babu and
                  Ganesh R. Kini and
                  P. Vijay Kumar},
  title        = {A tight rate bound and a matching construction for locally recoverable
                  codes with sequential recovery from any number of multiple erasures},
  booktitle    = {2017 {IEEE} International Symposium on Information Theory, {ISIT}
                  2017, Aachen, Germany, June 25-30, 2017},
  pages        = {1778--1782},
  publisher    = {{IEEE}},
  year         = {2017},
  url          = {https://doi.org/10.1109/ISIT.2017.8006835},
  doi          = {10.1109/ISIT.2017.8006835},
  timestamp    = {Fri, 31 Jan 2020 16:14:16 +0100},
  biburl       = {https://dblp.org/rec/conf/isit/BalajiKK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.