80 citations · 269 across the 18 of their papers we have counts for
18 papers · 1 filter
Efficient Repair of (k+2, k) Degraded Read Friendly MDS Array Codes With Sub-packetization 2
Jie Li, Xiaohu Tang
In this paper, we present two constructions of degraded read friendly (DRF) MDS array codes with two parity nodes and a sub-packetization level of 2 over small finite fields, appli…
MDS Array Codes With Small Sub-packetization Levels and Small Repair Degrees
Jie Li, Yi Liu, Xiaohu Tang +3
High-rate minimum storage regenerating (MSR) codes are known to require a large sub-packetization level, which can make meta-data management difficult and hinder implementation in…
MDS Array Codes With (Near) Optimal Repair Bandwidth for All Admissible Repair Degrees
Jie Li, Yi Liu, Xiaohu Tang +3
Abundant high-rate (n, k) minimum storage regenerating (MSR) codes have been reported in the literature. However, most of them require contacting all the surviving nodes during a n…
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…
Information-Theoretically Private Matrix Multiplication From MDS-Coded Storage
Jinbao Zhu, Songze Li, Jie Li
We study two problems of private matrix multiplication, over a distributed computing system consisting of a master node, and multiple servers that collectively store a family of pu…
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…
Private and Secure Distributed Matrix Multiplication Schemes for Replicated or MDS-Coded Servers
Jie Li, Camilla Hollanti
In this paper, we study the problem of \emph{private and secure distributed matrix multiplication (PSDMM)}, where a user having a private matrix and non-colluding servers s…
Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR
Jie Li, Okko Makkonen, Camilla Hollanti +1
This work considers the problem of privately outsourcing the computation of a matrix product over a finite field to helper servers. These servers are considered…
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…
Towards the Capacity of Private Information Retrieval from Coded and Colluding Servers
Lukas Holzbaur, Ragnar Freij-Hollanti, Jie Li +1
In this work, two practical concepts related to private information retrieval (PIR) are introduced and coined full support-rank PIR and strongly linear PIR. Being of full support-r…
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…
A Generic Transformation for Optimal Node Repair in MDS Array Codes over
Jie Li, Xiaohu Tang, Camilla Hollanti
For high-rate linear systematic maximum distance separable (MDS) codes, most early constructions could initially optimally repair all the systematic nodes but not all the parity no…
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…
A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems
Jie Li, Xiaohu Tang, Chao Tian
We propose a generic transformation that can convert any nonbinary maximum distance separable (MDS) code into another MDS code over the same field such that 1)…
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…
A Sytematic Piggybacking Design for Minimum Storage Regenerating Codes
Bin Yang, Xiaohu Tang, Jie Li
Piggybacking is an efficient method to decrease the repair bandwidth of Maximum Distance Separable (MDS) codes or Minimum Storage Regenerating (MSR) codes. In this paper, for minim…
New Repair strategy of Hadamard Minimum Storage Regenerating Code for Distributed Storage System
Xiaohu Tang, Bin Yang, Jie Li
The newly presented Hadamard minimum storage regenerating (MSR) code is the first class of high rate storage code with optimal repair property for all single node failure…
A Framework of Constructions of Minimal Storage Regenerating Codes with the Optimal Access/Update Property
Jie Li, Xiaohu Tang, Udaya Parampalli
In this paper, we present a generic framework for constructing systematic minimum storage regenerating codes with two parity nodes based on the invariant subspace technique. Codes…