Repairing Reed-Solomon Codes With Multiple Erasures
| Autor: | Hoang Dau, Olgica Milenkovic, Iwan Duursma, Han Mao Kiah |
|---|---|
| Přispěvatelé: | School of Physical and Mathematical Sciences |
| Rok vydání: | 2018 |
| Předmět: |
Maintenance Engineering
FOS: Computer and information sciences Computer science Computer Science - Information Theory Information Theory (cs.IT) Code word 020206 networking & telecommunications 020207 software engineering Data_CODINGANDINFORMATIONTHEORY 02 engineering and technology Library and Information Sciences Computer Science Applications Reed–Solomon error correction Encoding Data_FILES 0202 electrical engineering electronic engineering information engineering Computer science and engineering [Engineering] Erasure Arithmetic Information Systems |
| Zdroj: | IEEE Transactions on Information Theory. 64:6567-6582 |
| ISSN: | 1557-9654 0018-9448 |
| DOI: | 10.1109/tit.2018.2827942 |
| Popis: | Despite their exceptional error-correcting properties, Reed-Solomon 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 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 Reed-Solomon 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. Comment: 15 pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|