首页> 外文期刊>IEEE Transactions on Information Theory >Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems
【24h】

Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems

机译:Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems

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

摘要

Maximally recoverable local repairable codes (MR LRCs for short) have received great attention in the last few years. Various constructions have been proposed in literature. The main focus of this topic is to construct MR LRCs over small fields. An interesting parameter regime for an $(N=nr,r,h, delta)$ -MR LRC is the constant global parities $h=O(1)$ . In this parameter setting, all previous constructions require the field size $ell =Omega _{h} (N^{h-1-o(1)})$ . It remains challenging to improve this bound. In this paper, via subspace direct sum systems, we present a construction of MR LRC with the field size $ell = Oleft({N^{h-2+frac {1}{h-1}-o(1)}}right)$ . In particular, for the interesting cases where $h=2,3$ , we improve previous constructions by either reducing field size or removing constraints. In addition, we also offer some constructions of MR LRCs for larger global parity $h$ . The main techniques used in this paper is through subspace direct sum systems that we introduce.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号