11 citations · 17 across the 3 of their papers we have counts for
3 papers
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…
cs.IT2015★ 11 cited
Achieving Arbitrary Locality and Availability in Binary Codes
Anyu Wang, Zhifang Zhang
The th coordinate of an code is said to have locality and availability if there exist disjoint groups, each containing at most other coordinates that can…
cs.IT2014★ 6 cited
An Integer Programming Based Bound for Locally Repairable Codes
Anyu Wang, Zhifang Zhang
The locally repairable code (LRC) studied in this paper is an linear code of which the value at each coordinate can be recovered by a linear combination of at most othe…