Two classes of optimal LRCs with information (r, t)-locality
Pan Tan, Zhengchun Zhou, Vladimir Sidorenko, Udaya Parampalli
Designs, Codes and Cryptography | Springer | Published : 2020
Locally repairable codes (LRCs) with (r, t)-locality have received considerable attention in recent years, since they are able to solve common problems in distributed storage systems such as repairing multiple node failures and managing hot data. Constructing LRCs with excellent parameters becomes an interesting research subject in distributed storage systems and coding theory. In this paper, we present two constructions of LRCs with information (r, t)-locality based on linear algebra and partial geometry, respectively. Both constructions generate LRCs with new parameters which are optimal with respect to the bound proposed by Rawat et al. (IEEE Trans Inf Theory 62(8):4481–4493, 2016).
Related Projects (1)
Awarded by National Natural Science Foundation of China
Awarded by Russian Government
Awarded by Australian Research Councils
The work of P. Tan and Z. Zhou was supported in part by the National Natural Science Foundation of China under Grants 61672028 and 11971395, and in part by Doctoral Innovation Fund Program of Southwest Jiaotong University.V. Sidorenko is on leave from Institute for Information Transmission Problems, Russian Academy of Sciences. His work is supported by the Russian Government (Contract No 14.W03.31.0019). U. Parampalli is supported in part by the Australian Research Councils Discovery under Grant DP150104473 and in part by the University of Melbourne's 2014 International Research and Research Training Fund.