Repairing Schemes for Tamo-Barg Codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911967917113344 |
|---|---|
| author | Cai, Han Miao, Ying Schwartz, Moshe Tang, Xiaohu |
| author_facet | Cai, Han Miao, Ying Schwartz, Moshe Tang, Xiaohu |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_12803 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Repairing Schemes for Tamo-Barg Codes Cai, Han Miao, Ying Schwartz, Moshe Tang, Xiaohu Information Theory 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. |
| title | Repairing Schemes for Tamo-Barg Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2312.12803 |