Optimal Locally Repairable Codes with Improved Update Complexity
Information Theory
2016-07-18 v3 math.IT
Abstract
For a systematic erasure code, update complexity (UC) is defined as the maximum number of parity blocks needed to be changed when some information blocks are updated. Locally repairable codes (LRCs) have been recently proposed and used in real-world distributed storage systems. In this paper, update complexity for optimal LRC is studied and both lower and upper bounds on UC are established in terms of length (n), dimension (k), minimum distance (d), and locality (r) of the code, when (r+1)|n. Furthermore, a class of optimal LRCs with small UC is proposed. Our proposed LRCs could be of interest as they improve UC without sacrificing optimality of the code.
Cite
@article{arxiv.1606.09463,
title = {Optimal Locally Repairable Codes with Improved Update Complexity},
author = {Mehrtash Mehrabi and Mostafa Shahabinejad and Masoud Ardakani and Majid Khabbazian},
journal= {arXiv preprint arXiv:1606.09463},
year = {2016}
}