Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > Codes Between MBR and MSR Poin...

Codes Between MBR and MSR Points With Exact Repair Property

Toni Ernvall, Codes Between MBR and MSR Points With Exact Repair Property. IEEE Transactions on Information Theory , 6993–7005, 2014.

http://dx.doi.org/10.1109/TIT.2014.2351252

Abstract:

In this paper, distributed storage systems with exact repair are studied. Constructions for exact-regenerating codes between the minimum storage regenerating (MSR) and the minimum bandwidth regenerating (MBR) points are given. To the best of our knowledge, no previous construction of exact-regenerating codes between MBR and MSR points is done except in the works by Tian et al. and Sasidharan et al. In contrast to their works, the methods used here are elementary. In this paper, it is shown that in the case that the parameters (n) , (k) , and (d) are close to each other, the given construction is close to optimal when comparing with the known functional repair capacity. This is done 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 constructed codes with exact repair and the known capacity of codes with functional repair, approaches to one. Also, a simple variation of the constructed codes with almost the same performance is given. Also some bounds for the capacity of exact-repairing codes are given. These bounds illustrate the relationships between storage codes with different parameters.

BibTeX entry:

@ARTICLE{jErnvall_Toni14a,
  title = {Codes Between MBR and MSR Points With Exact Repair Property},
  author = {Ernvall, Toni},
  journal = {IEEE Transactions on Information Theory},
  pages = {6993–7005},
  year = {2014},
  ISSN = {0018-9448},
}

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

Publication Forum rating of this publication: level 3

Edit publication