9 citations · 12 across the 3 of their papers we have counts for
6 papers
PMDS Array Codes With Small Sub-packetization, Small Repair Bandwidth/Rebuilding Access
Jie Li, Xiaohu Tang, Hanxu Hou +3
Partial maximum distance separable (PMDS) codes are a kind of erasure codes where the nodes are divided into multiple groups with each forming an MDS code with a smaller code lengt…
A Generic Transformation to Generate MDS Storage Codes with -Optimal Access Property
Yi Liu, Jie Li, Xiaohu Tang
For high-rate maximum distance separable (MDS) codes, most of them are designed to optimally repair a single failed node by connecting all the surviving nodes. However, in practica…
Towards Practical Private Information Retrieval from MDS Array Codes
Jie Li, David Karpuk, Camilla Hollanti
Private information retrieval (PIR) is the problem of privately retrieving one out of original files from severs, i.e., each individual server learns nothing about the file…
A Systematic Construction of MDS Codes With Small Sub-packetization Level and Near-Optimal Repair Bandwidth
Jie Li, Yi Liu, Xiaohu Tang
In the literature, all the known high-rate MDS codes with the optimal repair bandwidth possess a significantly large sub-packetization level, which may prevent the codes to be impl…
Linear Coded Caching Scheme for Centralized Networks
Minquan Cheng, Jie Li, Xiaohu Tang +1
Coded caching systems have been widely studied to reduce the data transmission during the peak traffic time. In practice, two important parameters of a coded caching system should…
Optimal Exact Repair Strategy for the Parity Nodes of the Zigzag Code
Jie Li, Xiaohu Tang
In this paper, we reinterprets the Zigzag code in coding matrix and then propose an optimal exact repair strategy for its parity nodes, whose repair disk I/O approaches a…