当前位置: X-MOL 学术IEEE Trans. Inform. Theory › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Constructions of locally repairable codes with multiple recovering sets via rational function fields
IEEE Transactions on Information Theory ( IF 2.5 ) Pub Date : 2020-01-01 , DOI: 10.1109/tit.2019.2946627
Lingfei Jin , Haibin Kan , Yu Zhang

Locally repairable codes with more than one recovering set are demanded in the application to distributed storage. For each failure node (or disk), it is desired to have as many recovering sets as possible. In this paper, we make use of automorphisms of rational function fields to construct locally repairable codes with multiple recovering sets. Although we focus on two recovering sets, our construction can be easily generalized to the case of multiple recovering sets. In particular, we obtain a class of locally repairable codes with minimum distance only 1 less than the upper bound.

中文翻译:

基于有理函数域的多恢复集局部可修复码的构造

在分布式存储的应用中需要具有多个恢复集的本地可修复代码。对于每个故障节点(或磁盘),希望有尽可能多的恢复集。在本文中,我们利用有理函数域的自同构来构造具有多个恢复集的局部可修复代码。尽管我们专注于两个恢复集,但我们的构造可以很容易地推广到多个恢复集的情况。特别是,我们获得了一类最小距离仅比上限小 1 的局部可修复代码。
更新日期:2020-01-01
down
wechat
bug