197 citations · 292 across the 19 of their papers we have counts for
19 papers
An Efficient Piggybacking Design Framework with Sub-packetization for All-Node Repair
Ke Wang, Zhifang Zhang
Piggybacking design has been widely applied in distributed storage systems since it can greatly reduce the repair bandwidth with small sub-packetization. Compared with other existi…
Rack-Aware Regenerating Codes with Multiple Erasure Tolerance
Liyang Zhou, Zhifang Zhang
In a modern distributed storage system, storage nodes are organized in racks, and the cross-rack communication dominates the system bandwidth. In We study the rack-aware storage sy…
Explicit Construction of Minimum Bandwidth Rack-Aware Regenerating Codes
Liyang Zhou, Zhifang Zhang
In large data centers, storage nodes are organized in racks, and the cross-rack transmission dominates the bandwidth cost. For the repair of single node failures, codes achieving t…
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…
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…
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…
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…
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…
Building Capacity-Achieving PIR Schemes with Optimal Sub-Packetization over Small Fields
Jingke Xu, Zhifang Zhang
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…
On Sub-Packetization and Access Number of Capacity-Achieving PIR Schemes for MDS Coded Non-Colluding Servers
Jingke Xu, Zhifang Zhang
Consider the problem of private information retrieval (PIR) over a distributed storage system where records are stored across servers by using an MDS code. For simp…
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…
Private Multi-File Retrieval From Distributed Databases
Zhifang Zhang, Jingke Xu
Suppose there are distributed databases each storing a full set of independent files. A user wants to retrieve out of the files without revealing the identity of th…
Bounds and Constructions for Linear Locally Repairable Codes over Binary Fields
Anyu Wang, Zhifang Zhang, Dongdai Lin
For binary linear locally repairable codes (LRCs), two new upper bounds on are derived. The first one applies to LRCs with disjoint local repair groups, for general v…
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…
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…
Repair Locality From a Combinatorial Perspective
Anyu Wang, Zhifang Zhang
Repair locality is a desirable property for erasure codes in distributed storage systems. Recently, different structures of local repair groups have been proposed in the definition…
Repair Locality with Multiple Erasure Tolerance
Anyu Wang, Zhifang Zhang
In distributed storage systems, erasure codes with locality is preferred because a coordinate can be recovered by accessing at most other coordinates which in turn greatly…
Network Coding Based on Chinese Remainder Theorem
Zhifang Zhang
Random linear network code has to sacrifice part of bandwidth to transfer the coding vectors, thus a head of size k log|T| is appended to each packet. We present a distributed rand…
Exact Cooperative Regenerating Codes with Minimum-Repair-Bandwidth for Distributed Storage
Anyu Wang, Zhifang Zhang
We give an explicit construction of exact cooperative regenerating codes at the MBCR (minimum bandwidth cooperative regeneration) point. Before the paper, the only known explicit M…