On the I/O Cost of Linear Repair Schemes for Arbitrary $(n,k)$ Reed-Solomon Codes
The I/O cost, i.e., the total number of symbols to be read during the single node failure/repair process in a distributed storage system, is one of the most important metrics in repairing Reed-Solomon (RS) codes by the linear repair scheme. In this paper, we construct a linear repair scheme that is applicable to arbitrary <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(n,\ k)$</tex> RS codes. We show that most existing repair schemes of RS codes can be viewed as a special case of our repair scheme.
Authors
- Linqi Song (ORCID: https://orcid.org/0000-0003-2756-4984)
- Hanxu Hou (ORCID: https://orcid.org/0000-0001-7328-9341)
- Zhongyi Huang (ORCID: https://orcid.org/0000-0002-5623-4864)
- Wenhao Liu (ORCID: https://orcid.org/0000-0002-8498-9295)
- Zhengyi Jiang (ORCID: https://orcid.org/0000-0002-2060-1108)
Institutions
- City University of Hong Kong (HK)
- Dongguan University of Technology (CN)
- Tsinghua University (CN)
Publication Details
- Published
- 2024-11-24
- DOI
- https://doi.org/10.1109/itw61385.2024.10806986
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China