Scholarlink

<p>The application of Reed-Solomon (RS) codes in distributed storage systems is widespread. A lot of literature has proposed repair schemes for RS codes with one or multiple failed symbols, which can reduce communication cost during repair (i.e. repair bandwidth). However, for repair schemes of RS codes with multiple failed symbols, the existing distributed repair schemes can only repair <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(e=\varvec{2}, \varvec{3}\)</EquationSource> </InlineEquation> erasures. In this paper, by intelligently dividing the set of evaluation points corresponding to failed symbols, a distributed repair scheme for RS codes with <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\varvec{e}\ge \varvec{4}\)</EquationSource> </InlineEquation> erasures is proposed.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Distributed repairing multiple erasures in Reed-Solomon codes

  • 期刊论文

  • 发表日期：

    2025年11月3日

查看全文
  • Xing Lin

摘要

The application of Reed-Solomon (RS) codes in distributed storage systems is widespread. A lot of literature has proposed repair schemes for RS codes with one or multiple failed symbols, which can reduce communication cost during repair (i.e. repair bandwidth). However, for repair schemes of RS codes with multiple failed symbols, the existing distributed repair schemes can only repair \(e=\varvec{2}, \varvec{3}\) erasures. In this paper, by intelligently dividing the set of evaluation points corresponding to failed symbols, a distributed repair scheme for RS codes with \(\varvec{e}\ge \varvec{4}\) erasures is proposed.