2 citations · 2 across the 5 of their papers we have counts for
8 papers
A Class of Minimum Storage Cooperative Regenerating Codes with Low Access Property
Xing Lin, Han Cai, Xiaohu Tang
In this paper, a new repair scheme for a modified construction of MDS codes is studied. The obtained repair scheme has optimal bandwidth for multiple failed nodes under the coopera…
A New Cooperative Repair Scheme with k + 1 Helper Nodes for (n, k) Hadamard MSR codes with Small Sub-packetization
Yajuan Liu, Han Cai, Xiaohu Tang
Cooperative repair model is an available technology to deal with multiple node failures in distributed storage systems. Recently, explicit constructions of cooperative MSR codes we…
Optimal Locally Repairable Codes: An Improved Bound and Constructions
Han Cai, Cuiling Fan, Ying Miao +2
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinat…
A Construction of Maximally Recoverable Codes with Order-Optimal Field Size
Han Cai, Ying Miao, Moshe Schwartz +1
We construct maximally recoverable codes (corresponding to partial MDS codes) which are based on linearized Reed-Solomon codes. The new codes have a smaller field size requirement…
On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes
Han Cai, Moshe Schwartz
Optimal locally repairable codes with information locality are considered. Optimal codes are constructed, whose length is also order-optimal with respect to a new bound on the code…
Network-Coding Solutions for Minimal Combination Networks and Their Sub-networks
Han Cai, Johan Chrisnata, Tuvi Etzion +2
Minimal multicast networks are fascinating and efficient combinatorial objects, where the removal of a single link makes it impossible for all receivers to obtain all messages. We…