Processing math: 100%
On the I/O Cost of Linear Repair Schemes for Arbitrary <span class="MathJax_Preview">(n,k)</span><script type="math/tex" id="MathJax-Element-1">(n,k)</script> Reed-Solomon Codes | IEEE Conference Publication | IEEE Xplore

On the I/O Cost of Linear Repair Schemes for Arbitrary (n,k) Reed-Solomon Codes


Abstract:

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 met...Show More

Abstract:

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 (n,\ k) RS codes. We show that most existing repair schemes of RS codes can be viewed as a special case of our repair scheme.
Date of Conference: 24-28 November 2024
Date Added to IEEE Xplore: 30 December 2024
ISBN Information:

ISSN Information:

Conference Location: Shenzhen, China

Funding Agency:


References

References is not available for this document.