...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >Codes Between MBR and MSR Points With Exact Repair Property
【24h】

Codes Between MBR and MSR Points With Exact Repair Property

机译：具有精确修复属性的MBR和MSR点之间的代码

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

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 and Sasidharan In contrast to their works, the methods used here are elementary. In this paper, it is shown that in the case that the parameters , , and 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 , , and 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.
机译：本文研究了具有精确维修功能的分布式存储系统。给出了在最小存储再生（MSR）点和最小带宽再生（MBR）点之间的精确再生代码的构造。据我们所知，除Tian和Sasidharan的著作外，以前没有在MBR和MSR点之间构造精确的再生码。与他们的著作相反，这里使用的方法是基本的。在本文中，表明在参数，和彼此接近的情况下，与已知的功能修复能力相比，给定的构造接近最佳。通过显示，当参数，和的距离固定但实际值接近无穷大时，具有精确修复的已构造代码的性能分数和具有功能修复的已知代码的性能分数接近1。而且，给出了具有几乎相同性能的构造代码的简单变化。还给出了精确修复码容量的一些界限。这些界限说明了具有不同参数的存储代码之间的关系。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号