当前位置:
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.)
New Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes From Their Zeros
IEEE Transactions on Information Theory ( IF 2.5 ) Pub Date : 2020-12-14 , DOI: 10.1109/tit.2020.3043759 Jing Qiu , Dabin Zheng , Fang-Wei Fu
IEEE Transactions on Information Theory ( IF 2.5 ) Pub Date : 2020-12-14 , DOI: 10.1109/tit.2020.3043759 Jing Qiu , Dabin Zheng , Fang-Wei Fu
An $(r, \delta)$
-locally repairable code (
$(r, \delta)$
-LRC for short) was introduced by Prakash et al. [14] for tolerating multiple failed nodes in distributed storage systems, which was a generalization of the concept of $r$
-LRCs produced by Gopalan et al. [5]
. An $(r, \delta)$
-LRC is said to be optimal if it achieves the Singleton-like bound. Recently, Chen et al. [2] generalized the construction of cyclic $r$
-LRCs proposed by Tamo et al. [19]
, [20] and constructed several classes of optimal $(r, \delta)$
-LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$
, respectively in terms of a union of the set of zeros controlling the minimum distance and the set of zeros ensuring the locality. Following the work of [2]
, [3]
, this paper first characterizes $(r, \delta)$
-locality of a cyclic code via its zeros. Then we construct several classes of optimal cyclic $(r, \delta)$
-LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$
, respectively from the product of two sets of zeros. Our constructions include all optimal cyclic $(r,\delta)$
-LRCs proposed in [2]
, [3]
, and our method seems more convenient to obtain optimal cyclic $(r, \delta)$
-LRCs with flexible parameters. Moreover, many optimal cyclic $(r,\delta)$
-LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$
, respectively with $(r+\delta -1)\nmid n$ can be obtained from our method.
中文翻译:
最优循环的新构造[R ,δ)从零开始的本地可修复代码
一个 $(r,\ delta)$
-本地可修复代码(
$(r,\ delta)$
-LRC)由Prakash等人介绍。 [14] 容忍分布式存储系统中的多个故障节点,这是对概念的概括 $ r $
-Gopalan等人生产的-LRC。 [5]
。一个 $(r,\ delta)$
-LRC被认为是最佳的,如果它达到了Singleton-like边界。最近,Chen等。[2] 广义循环的构造 $ r $
-LRC由Tamo等人提出。 [19]
, [20] 并构造了几类最优 $(r,\ delta)$
-LRC长度 $ n $ 为了 $ n \,| \,(q-1)$ 或者 $ n \,| \,(q + 1)$
,分别是控制最小距离的零位集合和确保局部性的零位集合的并集。继工作[2]
, [3]
,本文首先表征 $(r,\ delta)$
-循环代码通过零的局部性。然后我们构造了几类最优循环 $(r,\ delta)$
-LRC长度 $ n $ 为了 $ n \,| \,(q-1)$ 或者 $ n \,| \,(q + 1)$
,分别来自两组零的乘积。我们的构造包括所有最佳循环 $(r,\ delta)$
-在 [2]
, [3]
,而我们的方法似乎更容易获得最佳循环 $(r,\ delta)$
-具有灵活参数的LRC。而且,许多最优循环 $(r,\ delta)$
-LRC长度 $ n $ 为了 $ n \,| \,(q-1)$ 或者 $ n \,| \,(q + 1)$
,分别与 $(r + \ delta -1)\ nmid n $ 可以从我们的方法中获得。
更新日期:2021-02-19
中文翻译:
最优循环的新构造
一个