IEEE Transactions on Information Theory · 2018 · 91 citations · 36 references
EngineeringComputer EngineeringComputer ScienceFault ToleranceFault-tolerant ComputingFault-tolerant SystemsCoding TheoryErasure CodingError Control CodingError CorrectionError-correcting CodesReliable Storage SystemsBandwidthErasure CorrectionError Correction CodesReed-solomon CodesReed-solomon CodingRegenerating CodesRepair BandwidthSymbol Erasures
Despite their exceptional error-correcting properties, Reed-Solomon (RS) codes have been overlooked in distributed storage applications due to the common belief that they have poor repair bandwidth. A naive repair approach would require for the whole file to be reconstructed in order to recover a single erased codeword symbol. In a recent work, Guruswami and Wootters (STOC'16) proposed a single erasure repair method for RS codes that achieves the optimal repair bandwidth amongst all linear encoding schemes. Their key idea is to recover the erased symbol by collecting a sufficiently large number of its traces, each of which can be constructed from a number of traces of other symbols. We extend the trace collection technique to cope with two and three erasures.
36
Network Coding for Distributed Storage Systems
Alexandros G. Dimakis, P. Brighten Godfrey, Yunnan Wu et al. · IEEE Transactions on Information Theory · 2010 · 2K citations
On the Locality of Codeword Symbols
Parikshit Gopalan, Cheng Huang, Huseyin Simitci et al. · IEEE Transactions on Information Theory · 2012 · 862 citations
A Survey on Network Codes for Distributed Storage
Alexandros G. Dimakis, Kannan Ramchandran, Yunnan Wu et al. · Proceedings of the IEEE · 2011 · 656 citations