arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1601.08190cs.ITmath.IT
收藏

关于带复制的MBR码

On MBR codes with replication

M. Nikhil Krishnan, P. Vijay Kumar

摘要:

Rashmi et.等人提出了$(n,k,d=n-1)$ MBR再生码的构造,其特征在于所有码符号的固有双重复制和传送修复(RBT),这两者在实践中都是重要的。我们首先表明,没有MBR代码可以包含一个代码符号,复制两次以上。然后,我们继续介绍两个新的家庭的MBR代码,其功能双重复制的所有系统的消息符号。代码还拥有一组$d$节点,其内容包括消息符号,并且可以通过传输帮助(HBT)来修复。作为一个推论,我们获得系统的RBT码的情况下,$d=(n-1)$具有固有的双重复制的所有代码符号,并具有一个字段大小的$O(n)$与一般相比,$O(n^2)$字段大小的要求,早期建设的Rashmi等。对于$(k=d=n-2)$或$(k+1=d=n-2)$的情况,字段大小可以减少到$q=2$,因此代码可以是二进制的。我们还给出了MBR码存在的一个充分必要条件,所有的代码符号的双重复制,并提出了技术,这将使任意MBR码转换为一个双重复制的所有的代码符号。

英文摘要:

An early paper by Rashmi et. al. presented the construction of an $(n,k,d=n-1)$ MBR regenerating code featuring the inherent double replication of all code symbols and repair-by-transfer (RBT), both of which are important in practice. We first show that no MBR code can contain even a single code symbol that is replicated more than twice. We then go on to present two new families of MBR codes which feature double replication of all systematic message symbols. The codes also possess a set of $d$ nodes whose contents include the message symbols and which can be repaired through help-by-transfer (HBT). As a corollary, we obtain systematic RBT codes for the case $d=(n-1)$ that possess inherent double replication of all code symbols and having a field size of $O(n)$ in comparison with the general, $O(n^2)$ field size requirement of the earlier construction by Rashmi et. al. For the cases $(k=d=n-2)$ or $(k+1=d=n-2)$, the field size can be reduced to $q=2$, and hence the codes can be binary. We also give a necessary and sufficient condition for the existence of MBR codes having double replication of all code symbols and also suggest techniques which will enable an arbitrary MBR code to be converted to one with double replication of all code symbols.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑