222 citations · 844 across the 56 of their papers we have counts for
56 papers
A Fundamental Tradeoff Among Storage, Computation, and Communication for Distributed Computing over Star Network
Qifa Yan, Xiaohu Tang, Meixia Tao +1
Coded distributed computing can alleviate the communication load by leveraging the redundant storage and computation resources with coding techniques in distributed computing. In t…
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…
New Spectrally Constrained Sequence Sets with Optimal {Periodic} Cross-Correlation
Zhifan Ye, Zhengchun Zhou, Zilong Liu +2
Spectrally constrained sequences (SCSs) play an important role in modern communication and radar systems operating over non-contiguous spectrum. Despite numerous research attempts…
Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes
Teng Lu, Xuan He, Peng Kang +2
In this paper, we consider how to partition the parity-check matrices (PCMs) to reduce the hardware complexity and computation delay for the row layered decoding of quasi-cyclic lo…
A Class of Minimum Storage Cooperative Regenerating Codes with Low Access Property
Xing Lin, Han Cai, Xiaohu Tang
In this paper, a new repair scheme for a modified construction of MDS codes is studied. The obtained repair scheme has optimal bandwidth for multiple failed nodes under the coopera…
A New Cooperative Repair Scheme with k + 1 Helper Nodes for (n, k) Hadamard MSR codes with Small Sub-packetization
Yajuan Liu, Han Cai, Xiaohu Tang
Cooperative repair model is an available technology to deal with multiple node failures in distributed storage systems. Recently, explicit constructions of cooperative MSR codes we…
Multi-User Blind Symmetric Private Information Retrieval from Coded Servers
Jinbao Zhu, Qifa Yan, Xiaohu Tang
The problem of Multi-user Blind -secure -colluding Symmetric Private Information Retrieval from Maximum Distance Separable (MDS) coded storage system with Byzantine and $…
A subfield-based construction of optimal linear codes over finite fields
Zhao Hu, Nian Li, Xiangyong Zeng +2
In this paper, we construct four families of linear codes over finite fields from the complements of either the union of subfields or the union of cosets of a subfield, which can p…
Several classes of bent functions over finite fields
Xi Xie, Nian Li, Xiangyong Zeng +2
Let be the finite field with elements and be the trace function from to , where is a…
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…
A class of APcN power functions over finite fields of even characteristic
Ziran Tu, Xiangyong Zeng, Yupeng Jiang +1
In this paper, we investigate the power functions over the finite field , where is a positive integer and . It is prove…
Achieve Efficient Position-Heap-based Privacy-Preserving Substring-of-Keyword Query over Cloud
Fan Yin, Rongxing Lu, Yandong Zheng +3
The cloud computing technique, which was initially used to mitigate the explosive growth of data, has been required to take both data privacy and users' query functionality into co…
Improved Constructions for Secure Multi-Party Batch Matrix Multiplication
Jinbao Zhu, Qifa Yan, Xiaohu Tang
This paper investigates the problem of Secure Multi-party Batch Matrix Multiplication (SMBMM), where a user aims to compute the pairwise products $\mathbf{A}\divideontimes\mathbf{B…
Capacity-Achieving Private Information Retrieval Schemes from Uncoded Storage Constrained Servers with Low Sub-packetization
Jinbao Zhu, Qifa Yan, Xiaohu Tang +1
This paper investigates reducing sub-packetization of capacity-achieving schemes for uncoded Storage Constrained Private Information Retrieval (SC-PIR) systems. In the SC-PIR syste…
On the differential spectrum of a class of power functions over finite fields
Nian Li, Yanan Wu, Xiangyong Zeng +1
Differential uniformity is a significant concept in cryptography as it quantifies the degree of security of S-boxes respect to differential attacks. Power functions of the form $F(…
Optimal Locally Repairable Codes: An Improved Bound and Constructions
Han Cai, Cuiling Fan, Ying Miao +2
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinat…
A Construction of Maximally Recoverable Codes with Order-Optimal Field Size
Han Cai, Ying Miao, Moshe Schwartz +1
We construct maximally recoverable codes (corresponding to partial MDS codes) which are based on linearized Reed-Solomon codes. The new codes have a smaller field size requirement…
Symmetric Private Polynomial Computation From Lagrange Encoding
Jinbao Zhu, Qifa Yan, Xiaohu Tang +1
The problem of -secure -colluding symmetric Private Polynomial Computation (PPC) from coded storage system with Byzantine and unresponsive servers is studied in this…
Adaptive Gradient Coding
Hankun Cao, Qifa Yan, Xiaohu Tang +1
This paper focuses on mitigating the impact of stragglers in distributed learning system. Unlike the existing results designed for a fixed number of stragglers, we developed a new…
A new Capacity-Achieving Private Information Retrieval Scheme with (Almost) Optimal File Length for Coded Servers
Jinbao Zhu, Qifa Yan, Chao Qi +1
In a distributed storage system, private information retrieval (PIR) guarantees that a user retrieves one file from the system without revealing any information about the identity…
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 Fundamental Storage-Communication Tradeoff for Distributed Computing with Straggling Nodes
Qifa Yan, Michèle Wigger, Sheng Yang +1
Placement delivery arrays for distributed computing (Comp-PDAs) have recently been proposed as a framework to construct universal computing schemes for MapReduce-like systems. In t…
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…
On Optimal Locally Repairable Codes with Super-Linear Length
Han Cai, Ying Miao, Moshe Schwartz +1
Locally repairable codes which are optimal with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. T…