The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size

DOI10.1109/TIT.2018.2884075MaRDI QIDQ5223961zbMATH OpenOpenAlexWikidataFDO

Authors Itzhak Tamo, Min Ye, Alexander Barg

Publication date 19 July 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2018.2884075

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cited in

(9)

• Locally recoverable codes correcting many erasures over small fields
• Erasures Repair for Decreasing Monomial-Cartesian and Augmented Reed-Muller Codes of High Rate
• Determinant Codes With Helper-Independent Repair for Single and Multiple Failures
• Codes for Distributed Storage
• Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction
• Distributed repair schemes for Reed-Solomon codes with multiple erasures
• Distributed repairing multiple erasures in Reed-Solomon codes
• Repairing multiple nodes for Reed-Solomon codes with less bandwidth
• Computing sharp recovery structures for locally recoverable codes

This page was built for publication: The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223961)