Repairing Schemes for Tamo-Barg Codes
Abstract
In this paper, the repair problem for erasures beyond locality in locally repairable codes is explored under a practical system setting, where a rack-aware storage system consists of racks, each containing a few parity checks. This is referred to as a rack-aware system with locality. Two repair schemes are devised to reduce the repair bandwidth for Tamo-Barg codes under the rack-aware model by setting each repair set as a rack. Additionally, a cut-set bound for locally repairable codes under the rack-aware model with locality is introduced. Using this bound, the second repair scheme is proven to be optimal. Furthermore, the partial-repair problem is considered for locally repairable codes under the rack-aware model with locality, and both repair schemes and bounds are introduced for this scenario.
Cite
@article{arxiv.2312.12803,
title = {Repairing Schemes for Tamo-Barg Codes},
author = {Han Cai and Ying Miao and Moshe Schwartz and Xiaohu Tang},
journal= {arXiv preprint arXiv:2312.12803},
year = {2024}
}