New bounds on the (n, k, d) storage systems with exact repair

@article{Mohajer2015NewBO,
  title={New bounds on the (n, k, d) storage systems with exact repair},
  author={Soheil Mohajer and Ravi Tandon},
  journal={2015 IEEE International Symposium on Information Theory (ISIT)},
  year={2015},
  pages={2056-2060}
}
The exact-repair problem for distributed storage systems is considered. Characterizing the optimal storage-vs-repair bandwidth tradeoff for such systems remains an open problem for more than four storage nodes. A new family of information theoretic bounds is provided for the storage-vs-repair bandwidth tradeoff for all (n, k, d) systems. The proposed bound readily recovers Tian's result for the (4, 3, 3) system, and hence suffices for exact characterization for this system. In addition, the… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS