activity
20122021
most citedRack-Aware Regenerating Codes with Fewer Helper Racks

6 citations · 23 across the 8 of their papers we have counts for

collaborators

9 papers

cs.IT20213 cited

Explicit Construction of Minimum Storage Rack-Aware Regenerating Codes for All Parameters

Liyang Zhou, Zhifang Zhang

We consider the rack-aware storage system where nodes are organized in racks each containing nodes, and any nodes can retr…

cs.IT20216 cited

Rack-Aware Regenerating Codes with Fewer Helper Racks

Zhifang Zhang, Liyang Zhou

We consider the rack-aware storage system where \(n\) nodes are organized in \(\bar{n}\) racks each containing \(u\) nodes, and any \(k\) nodes can retrieve the stored file. Moreov…

cs.IT20193 cited

A Capacity-Achieving -PIR Scheme Based On MDS Array Codes

Jingke Xu, Yaqian Zhang, Zhifang Zhang

Suppose a database containing records is replicated in each of servers, and a user wants to privately retrieve one record by accessing the servers such that identity of the…

cs.IT20192 cited

An Improved Cooperative Repair Scheme for Reed-Solomon Codes

Yaqian Zhang, Zhifang Zhang

Dau et al. recently extend Guruswami and Wootters' scheme (STOC'2016) to cooperatively repair two or three erasures in Reed-Solomon (RS) codes. However, their scheme restricts to e…

cs.IT2018

Scalar MSCR Codes via the Product Matrix Construction

Yaqian Zhang, Zhifang Zhang

An cooperative regenerating code provides the optimal-bandwidth repair for any node failures in a cooperative way. In particular, an MSCR (minimum storage c…

cs.IT20173 cited

Capacity-Achieving PIR Schemes with Optimal Sub-Packetization

Zhifang Zhang, Jingke Xu

Suppose a database containing records is replicated across servers, and a user wants to privately retrieve one record by accessing the servers such that identity of the ret…