Abstract
Minimum storage regenerating (MSR) codes are MDS codes which allow for recovery of any single erased symbol with optimal repair bandwidth, based on the smallest possible fraction of the contents downloaded from each of the other symbols. Recently, certain Reed- Solomon codes were constructed which are MSR. However, the sub-packetization of these codes is exponentially large, growing like nΩ(n) in the constant-rate regime. In this work, we study the relaxed notion of ϵ-MSR codes, which incur a factor of (1 + ϵ) higher than the optimal repair bandwidth, in the context of Reed-Solomon codes. We give constructions of constant-rate ϵ-MSR Reed-Solomon codes with polynomial sub-packetization of nO(l/ϵ) and thereby giving an explicit tradeoff between the repair bandwidth and sub-packetization.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
