Distributed repairing multiple erasures in Reed-Solomon codes
Author:
- 3 November 2025
- journal article
- research article
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (2) , 367-393
Abstract
No abstract availableKeywords
All Related Versions
This publication has 44 references indexed in Scilit:
- An Improved Cooperative Repair Scheme for Reed-Solomon Codes2019
- Erasure coding for distributed storage: an overviewScience China Information Sciences, 2018
- An Overview of Coding for Distributed Storage Systems2018
- A tradeoff between the sub-packetization size and the repair bandwidth for reed-solomon code2017
- Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound2017
- An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and d < (n − 1)2017
- Optimal repair schemes for some families of full-length reed-solomon codes2017
- A generic transformation for optimal repair bandwidth and rebuilding access in MDS codes2017
- Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth2016
- Network Coding for Distributed Storage Systems2007