Repairing multiple nodes for Reed-Solomon codes with less bandwidth

DOI10.1016/J.IC.2026.105493MaRDI QIDQ7353776zbMATH OpenFDO

Authors Shu Liu, Yunqi Wan

Publication date 18 September 2026

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2026.105493

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• New MDS Self-Dual Codes From Generalized Reed—Solomon Codes
• On the quantitative hardness of CVP
• Repairing Multiple Failures for Scalar MDS Codes
• Repairing Reed-Solomon Codes
• Repairing Reed-Solomon Codes With Multiple Erasures
• The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size

This page was built for publication: Repairing multiple nodes for Reed-Solomon codes with less bandwidth

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