A Connection Between Locally Repairable Codes and Exact Regenerating Codes

2016 IEEE International Symposium on Information Theory (ISIT)(2016)

引用 5|浏览19
暂无评分
摘要
Typically, locally repairable codes (LRCs) and regenerating codes have been studied independently of each other, and it has not been clear how the parameters of one relate to those of the other. In this paper, a novel connection between locally repairable codes and exact regenerating codes is established. Via this connection, locally repairable codes are interpreted as exact regenerating codes. Further, some of these codes are shown to perform better than time-sharing codes between minimum bandwidth regenerating and minimum storage regenerating codes.
更多
查看译文
关键词
locally-repairable codes,exact regenerating codes,LRC,time-sharing codes,minimum bandwidth regenerating codes,minimum storage regenerating codes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要