Where academic tradition
meets the exciting future

Exact-Regenerating Codes Between MBR and MSR Points

Toni Ernvall, Exact-Regenerating Codes Between MBR and MSR Points. In: Khaled Abdel-Ghaffar, Salman Avestimehr, Mathieu Bloch, Paul Cuff, Zoran Cvetkovic, Alex Dimakis, Lara Dolecek, Stark Draper, Uri Erez, Andrea Goldsmith, Vivek Goyal, Dongning Guo, Bruce Hajek (Eds.), 2013 IEEE Information Theory Workshop (ITW), 1–5, IEEE, 2013.

http://dx.doi.org/10.1109/ITW.2013.6691307

Abstract:

In this paper we study distributed storage systems with exact repair. We give a construction for regenerating codes between the minimum storage regenerating (MSR) and the minimum bandwidth regenerating (MBR) points and show that in the case that the parameters n, k, and d are close to each other our constructions are close to optimal when comparing to the known capacity when only functional repair is required. We do this by showing that when the distances of the parameters n, k, and d are fixed but the actual values approach to infinity, the fraction of the performance of our codes with exact repair and the known capacity of codes with functional repair approaches to one.

BibTeX entry:

@INPROCEEDINGS{inpErnvall_Toni13a,
  title = {Exact-Regenerating Codes Between MBR and MSR Points},
  booktitle = {2013 IEEE Information Theory Workshop (ITW)},
  author = {Ernvall, Toni},
  editor = {Abdel-Ghaffar, Khaled and Avestimehr, Salman and Bloch, Mathieu and Cuff, Paul and Cvetkovic, Zoran and Dimakis, Alex and Dolecek, Lara and Draper, Stark and Erez, Uri and Goldsmith, Andrea and Goyal, Vivek and Guo, Dongning and Hajek, Bruce},
  publisher = {IEEE},
  pages = {1–5},
  year = {2013},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 1

Edit publication