Practical Considerations in Repairing Reed-Solomon Codes

The issue of repairing Reed-Solomon codes currently employed in industry has been sporadically discussed in the literature. In this work we carry out a systematic study of these codes and investigate important aspects of repairing them under the trace repair framework, including which evaluation poi...

Full description

Saved in:
Bibliographic Details
Published in2022 IEEE International Symposium on Information Theory (ISIT) pp. 2607 - 2612
Main Authors Dinh, Thi Xinh, Nhi Nguyen, Luu Y, Mohan, Lakshmi J., Boztas, Serdar, Luong, Tran Thi, Dau, Son Hoang
Format Conference Proceeding
LanguageEnglish
Published IEEE 26.06.2022
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:The issue of repairing Reed-Solomon codes currently employed in industry has been sporadically discussed in the literature. In this work we carry out a systematic study of these codes and investigate important aspects of repairing them under the trace repair framework, including which evaluation points to select and how to implement a trace repair scheme efficiently. In particular, we employ different heuristic algorithms to search for low-bandwidth repair schemes for codes of short lengths with typical redundancies and establish three tables of current best repair schemes for [n, k] Reed-Solomon codes over GF(256) with 4 ≤ n ≤ 16 and r = n − k ∈ {2, 3, 4}. The tables cover most known codes currently used in the distributed storage industry.
ISSN:2157-8117
DOI:10.1109/ISIT50566.2022.9834830