Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6
Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6
复制标题
最小距离为 5 和 6 的局部可修复代码的改进边界和单例最优构造
DOI：
10.1109/tit.2020.3036279
复制
发表时间：
2021-01
期刊：
影响因子：
--
通讯作者：
Fang-Wei Fu
中科院分区：
文献类型：
--
作者：
Bin Chen;Weijun Fang;Shu-Tao Xia;Jie Hao;Fang-Wei Fu
Repair locality has been an important metric in a distributed storage system (DSS). Erasure codes with small locality are more popular in a DSS, which means fewer available nodes participating in the repair process of failed nodes. Locally repairable codes (LRCs) as a new coding scheme have given more rise to the system performance and attracted a lot of interest in the theoretical research in coding theory. The particular concern among the research problems is the bounds and optimal constructions of LRCs. The problem of optimal constructions of LRCs includes the most important case of Singleton-optimal LRCs whose minimum distance achieves the Singleton-like bound, which is the core consideration in this paper. In this work, we first of all derive an improved and general upper bound on the code length of Singleton-optimal LRCs with minimum distance <inline-formula> <tex-math notation="LaTeX">$d=5, 6$ </tex-math></inline-formula>, some known constructions are shown to exactly achieve our new bound, which verifies its tightness. For locality <inline-formula> <tex-math notation="LaTeX">$r=2$ </tex-math></inline-formula> and distance <inline-formula> <tex-math notation="LaTeX">$d=6$ </tex-math></inline-formula>, we construct three new Singleton-optimal LRCs whose code length <inline-formula> <tex-math notation="LaTeX">$n=3(q+1)$ </tex-math></inline-formula>, <inline-formula> <tex-math notation="LaTeX">$n=3(q+\sqrt {q}+1)$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$n=3(2q-4)$ </tex-math></inline-formula>, respectively. Moreover, we obtain a complete characterization for Singleton-optimal LRCs with <inline-formula> <tex-math notation="LaTeX">$r=2$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$d=6$ </tex-math></inline-formula>. Such characterization has established an important connection between the existence of Singleton-optimal LRCs and that of a special subset of lines of finite projective plane <inline-formula> <tex-math notation="LaTeX">$PG(2, q)$ </tex-math></inline-formula>, thus provides a methodology for constructing LRCs with longer length based on any advance on finite projective plane <inline-formula> <tex-math notation="LaTeX">$PG(2, q)$ </tex-math></inline-formula>. In the end, we employ the well-known line-point incidence matrix and Johnson bounds for constant weight codes to derive tighter upper bounds on the code length. These new bounds further help us to prove that some of the previous Singleton-optimal constructions or their extensions achieve the longest possible code length for <inline-formula> <tex-math notation="LaTeX">$q=3, 4, 5, 7$ </tex-math></inline-formula>. It’s worth noting that all of our Singleton-optimal constructions possess small locality <inline-formula> <tex-math notation="LaTeX">$r=2$ </tex-math></inline-formula>, which are attractive in a DSS.
登录
查看更多内容
通过二进制恒重码显式构造距离 5 和 6 的最优局部可恢复码
影响因子：
2.5
作者：
Jin Lingfei
通讯作者：
Jin Lingfei
DOI：
10.14778/2535573.2488339
发表时间：
2013-01
期刊：
ArXiv
影响因子：
--
作者：
M. Sathiamoorthy;Megasthenis Asteris;Dimitris Papailiopoulos;A. Dimakis;Ramkumar Vadali;Scott Chen;
通讯作者：
M. Sathiamoorthy;Megasthenis Asteris;Dimitris Papailiopoulos;A. Dimakis;Ramkumar Vadali;Scott Chen;
DOI：
10.37236/1162
发表时间：
2006-05
期刊：
Electron. J. Comb.
影响因子：
--
作者：
Derek H. Smith;Lesley A. Hughes;S. Perkins
通讯作者：
Derek H. Smith;Lesley A. Hughes;S. Perkins
影响因子：
3.9
作者：
Yichong Xia;Bin Chen
通讯作者：
Yichong Xia;Bin Chen
DOI：
10.1109/isit.2017.8006886
发表时间：
2017-01
期刊：
2017 IEEE International Symposium on Information Theory (ISIT)
影响因子：
--
作者：
Anyu Wang;Zhifang Zhang;D. Lin
通讯作者：
Anyu Wang;Zhifang Zhang;D. Lin