Repairing Reed-solomon codes

DOI10.1145/2897518.2897525zbMath1377.94074arXiv1509.04764OpenAlexW2963072024WikidataQ131123119 ScholiaQ131123119MaRDI QIDQ5361831

Mary Wootters, Venkatesan Guruswami

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.04764

zbMATH Keywords

Reed-Solomon codesregenerating codesexact repair problem

Mathematics Subject Classification ID

Cyclic codes (94B15)

Related Items (8)

Adaptive extractors and their application to leakage resilient secret sharing ⋮ Constructing locally leakage-resilient linear secret-sharing schemes ⋮ Short leakage resilient and non-malleable secret sharing schemes ⋮ Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family ⋮ Improved single-round secure multiplication using regenerating codes ⋮ Universal secure rank-metric coding schemes with optimal communication overheads ⋮ Lower bounds for leakage-resilient secret sharing ⋮ Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages

This page was built for publication: Repairing Reed-solomon codes