Speaker: 徐敬可，山东农业大学

Title: Repairing Reed-Solomon Codes via Subspace Polynomials for more parameters

Language: Chinese

Time & Venue: 2024.08.13 19:00-20:00 思源楼415

Abstract: In distributed storage, cooperative repair is to simultaneously recover h(h>1) node erasures by downloading data from surviving nodes as well as collaboration between the hreplacement nodes. In this work, we propose a generalized cooperative repair framework for Reed-Solomon (RS) codes with two erasures. The key idea is to construct parity-check polynomialsfor the two replacement nodes respectively and then reduce the repair problem to the design of a linearized permutation polynomial related to the parity-check polynomials. We provide constructions of the linearized permutation polynomial in several cases, leading to cooperative repair schemes accordingly. Compared with the schemes given by [Dau. et al.TIT2021], our schemes retain the same repair bandwidth while apply to a much wider parameter regime and need only one-round collaboration.