Locally Repairable Convertible Codes: Improved Lower Bound and General Construction
By: Songping Ge, Han Cai, Xiaohu Tang
Potential Business Impact:
Makes data storage more reliable and faster.
In this paper, we consider the convertible code with locally repairable property. We present an improved lower bound on access cost associated with $(r,\delta)$. Then, we provide a general construction of convertible codes with optimal access cost which shows that those codes can be with super-linear length or maximum repairable property. Additionally, employing the known locally repairable codes with super-linear length or maximum repairable property, we provide explicit constructions of convertible codes with super-linear length or maximum repairable property.
Similar Papers
Bounds and Optimal Constructions of Generalized Merge-Convertible Codes for Code Conversion into LRCs
Information Theory
Saves storage space by fixing data errors smartly.
Extension of Optimal Locally Repairable codes
Information Theory
Makes data storage more reliable and easier to fix.
Maximally recoverable codes with locality and availability
Information Theory
Stores data more reliably with less space.