首页> 外文OA文献 >An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes
【2h】

An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes

机译:改进的存储修复带宽权衡外约束   精确修复再生代码

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In this paper we establish an improved outer bound on thestorage-repair-bandwidth tradeoff of regenerating codes under exact repair. Theresult shows that in particular, it is not possible to construct exact-repairregenerating codes that asymptotically achieve the tradeoff that holds forfunctional repair. While this had been shown earlier by Tian for the specialcase of $[n,k,d]=[4,3,3]$ the present result holds for general $[n,k,d]$. Thenew outer bound is obtained by building on the framework established earlier byShah et al.
机译:在本文中,我们为精确修复下的再生代码的存储-修复-带宽权衡建立了一个改进的外边界。结果表明,特别地,不可能构造渐进地实现保持功能性维修的权衡的精确修复再生代码。尽管Tian早先已针对$ [n,k,d] = [4,3,3] $的特殊情况证明了这一点,但当前结果适用于一般$ [n,k,d] $。通过在Shah等人先前建立的框架上构建,可以获得新的外部界限。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号