3 papers
cs.IT2025
Asymptotically Optimal Repair of Reed-Solomon Codes with Small Sub-Packetization under Rack-Aware Model
Ke Wang, Zhongyan Liu, Rengang Li +2
This paper presents a comprehensive study on the asymptotically optimal repair of Reed-Solomon (RS) codes with small sub-packetization, specifically tailored for rack-aware distrib…
cs.IT2024
Calculating the I/O Cost of Linear Repair Schemes for RS Codes Evaluated on Subspaces via Exponential Sums
Zhongyan Liu, Jingke Xu, Zhifang Zhang
The I/O cost, defined as the amount of data accessed at helper nodes during the repair process, is a crucial metric for repair efficiency of Reed-Solomon (RS) codes. Recently, a fo…
cs.IT2024
A Formula for the I/O Cost of Linear Repair Schemes and Application to Reed-Solomon Codes
Zhongyan Liu, Zhifang Zhang
Node repair is a crucial problem in erasure-code-based distributed storage systems. An important metric for repair efficiency is the I/O cost which equals the total amount of data…