首页> 外文期刊>Designs, Codes and Crytography >Two classes of optimal LRCs with information (r, t)-locality
【24h】

Two classes of optimal LRCs with information (r, t)-locality

机译:两类最佳LRC,具有信息(R,T) - 单位

获取原文
获取原文并翻译 | 示例
           

摘要

Locally repairable codes (LRCs) with (r, t)-locality have received considerable attention in recent years, since they are able to solve common problems in distributed storage systems such as repairing multiple node failures and managing hot data. Constructing LRCs with excellent parameters becomes an interesting research subject in distributed storage systems and coding theory. In this paper, we present two constructions of LRCs with information (r, t)-locality based on linear algebra and partial geometry, respectively. Both constructions generate LRCs with new parameters which are optimal with respect to the bound proposed by Rawat et al. (IEEE Trans Inf Theory 62(8):4481-4493, 2016).
机译:近年来,具有(R,T)-Locity的本地可修复的代码(LRC)已经接受了相当大的关注,因为它们能够解决分布式存储系统中的常见问题,例如修复多个节点故障并管理热数据。构建具有优异参数的LRC成为分布式存储系统和编码理论中的一个有趣的研究主题。在本文中,我们分别介绍了一种基于线性代数和部分几何形状的信息(R,T) - 为单位的信息(R,T)的两个结构。两个结构都产生了具有新参数的LRC,该参数对于Rawat等人提出的结合而最佳。 (IEEE Trans Inf理论62(8):4481-4493,2016)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号