Locally Repairable Regenerating Code Constructions
Information Theory
2016-05-06 v2 math.IT
Abstract
In this work, we give locally repairable regenerating code (LRRC) [1]-[3], [5], [6] constructions that can protect the file size promised by the graph analysis of the modified family helper selection (MFHS) scheme [1] at the minimum-bandwidth-regenerating (MBR) point.
Cite
@article{arxiv.1605.00020,
title = {Locally Repairable Regenerating Code Constructions},
author = {Imad Ahmad and Chih-Chun Wang},
journal= {arXiv preprint arXiv:1605.00020},
year = {2016}
}
Comments
6 pages