Asymptotically Optimal Repair of Reed-Solomon Codes with Small Sub-Packetization under Rack-Aware Model
Abstract
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 distributed storage systems. Through the utilization of multi-base expansion, we introduce a novel approach that leverages monomials to construct linear repair schemes for RS codes. Our repair schemes which adapt to all admissible parameters achieve asymptotically optimal repair bandwidth while significantly reducing the sub-packetization compared with existing schemes. Furthermore, our approach is capable of repairing RS codes with asymptotically optimal repair bandwidth under the homogeneous storage model, achieving smaller sub-packetization than existing methods.
Keywords
Cite
@article{arxiv.2507.11009,
title = {Asymptotically Optimal Repair of Reed-Solomon Codes with Small Sub-Packetization under Rack-Aware Model},
author = {Ke Wang and Zhongyan Liu and Rengang Li and Yaqian Zhao and Yaqiang Zhang},
journal= {arXiv preprint arXiv:2507.11009},
year = {2025}
}
Comments
This work has been accepted by 2025 IEEE Information Theory Workshop