The storage-repair-bandwidth trade-off of exact repair linear regenerating codes for the case d = k = n - 1

N. Prakash, M. Nikhil Krishnan. The storage-repair-bandwidth trade-off of exact repair linear regenerating codes for the case d = k = n - 1. In IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015. pages 859-863, IEEE, 2015. [doi]

@inproceedings{PrakashK15,
  title = {The storage-repair-bandwidth trade-off of exact repair linear regenerating codes for the case d = k = n - 1},
  author = {N. Prakash and M. Nikhil Krishnan},
  year = {2015},
  doi = {10.1109/ISIT.2015.7282577},
  url = {http://dx.doi.org/10.1109/ISIT.2015.7282577},
  researchr = {https://researchr.org/publication/PrakashK15},
  cites = {0},
  citedby = {0},
  pages = {859-863},
  booktitle = {IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015},
  publisher = {IEEE},
  isbn = {978-1-4673-7704-1},
}