Linear programming bounds for robust locally repairable storage codes
Date
2014
Authors
Tebbi, M.A.
Chan, T.H.
Sung, C.W.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
2014 IEEE Information Theory Workshop (ITW), 2014, pp.50-54
Statement of Responsibility
Conference Name
2014 IEEE Information Theory Workshop, ITW 2014 (2 Nov 2014 - 5 Nov 2014 : Hobart, Australia)
Abstract
Locally repairable codes are used in distributed storage networks to minimise the number of survived nodes required to repair a failed node. However, the robustness of these codes is a main concern since locally repair procedure may fail when there are multiple node failures. This paper proposes a new class of robust locally repairable codes which guarantees that a failed node can be repaired locally even when there are multiple node failures. Upper bound on the size of robust locally repairable codes using linear programming tools are obtained and examples of robust locally repairable codes attaining these bounds are constructed.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2014 IEEE