The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size
From MaRDI portal
Publication:5223961
DOI10.1109/TIT.2018.2884075zbMath1431.94170OpenAlexW2902882503WikidataQ128868848 ScholiaQ128868848MaRDI QIDQ5223961
Min Ye, Itzhak Tamo, 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
Related Items
Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction, Locally recoverable codes correcting many erasures over small fields, Computing sharp recovery structures for locally recoverable codes, Codes for Distributed Storage
