14 citations · 20 across the 11 of their papers we have counts for
11 papers · 1 filter
Optimal-Access Cooperative MSR Codes: Parity-Check Matrix Construction And a Unified Transformation
Yaqian Zhang, Jingke Xu, Ya-Feng Liu
Cooperative MSR codes are a kind of storage codes which enable optimal-bandwidth repair of any node erasures in a cooperative way, while retaining the minimum storage as a…
Private Information Retrieval from Joint Systematic MDS-Coded with Non-Colluding Servers: Bounds and Constructions
Jingke Xu, Lirong Shi, Peng Lan +1
Consider a distributed storage system consisting of non-colluding servers that collectively store a database of files encoded using an maximum distance separable(MD…
A Disguise-and-Squeeze PIR Scheme for the MDS-TPIR Setting and Beyond
Rui Sun, Ran Tao, Jingke Xu +1
We consider the problem of private information retrieval (PIR) from MDS coded databases with colluding servers, i.e., MDS-TPIR. In the MDS-TPIR setting, files are stored across…
Reducing The Sub-packetization Level of Optimal-Access Cooperative MSR Codes
Yaqian Zhang, Jingke Xu
Cooperative MSR codes are a kind of storage codes which enable optimal-bandwidth repair of any node erasures in a cooperative way, while retaining the minimum storage as a…
Calculating the I/O Cost of Linear Repair Schemes for RS Codes Evaluated on Subspaces via Exponential Sums
Zhongyan Liu, Jingke Xu, Zhifang Zhang
The I/O cost, defined as the amount of data accessed at helper nodes during the repair process, is a crucial metric for repair efficiency of Reed-Solomon (RS) codes. Recently, a fo…
Deep Holes of Twisted Reed-Solomon Codes
Weijun Fang, Jingke Xu, Ruiqi Zhu
The deep holes of a linear code are the vectors that achieve the maximum error distance (covering radius) to the code. {Determining the covering radius and deep holes of linear cod…
Optimal Locally Repairable Codes via Punctured Simplex Codes
Yuan Gao, Weijun Fang, Jingke Xu +2
Locally repairable codes (LRCs) have attracted a lot of attention due to their applications in distributed storage systems. In this paper, we provide new constructions of optimal $…
Folded Polynomial Codes for Coded Distributed -Type Matrix Multiplication
Jingke Xu, Yaqian Zhang, Libo Wang
In this paper, due to the important value in practical applications, we consider the coded distributed matrix multiplication problem of computing in a distributed computi…
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…
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…