• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound
【24h】

Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound

机译：Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound

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

摘要

We present two lower bounds on sub-packetization level $alpha $ of MSR codes with parameters $(n, k, d=n-1, alpha )$ where $n$ is the block length, $d$ is the number of helper nodes contacted during single-node repair, $alpha $ the sub-packetization level and $kalpha $ the scalar dimension. The first bound we present is for any MSR code and is given by $alpha ge e^{frac {(k-1)(r-1)}{2r^{2}}}$ . The second bound we present is for the case of optimal-access MSR codes and the bound is given by $alpha ge min left{{ r^{frac {n-1}{r}}, r^{k-1} }right}$ . There exist optimal-access MSR constructions that achieve the second sub-packetization level bound with an equality making this bound tight. We also prove that for an optimal-access MSR code to have optimal sub-packetization level under the constraint that the $beta $ scalar symbol indices we access from a given helper node is dependent only on the index of the failed node, it is necessary that the support of the parity-check matrix be the same as the support structure of the existing MSR constructions in literature such as the Clay code.

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号