2 citations · 2 across the 6 of their papers we have counts for
10 papers
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…
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…
Strongly separable matrices for nonadaptive combinatorial group testing
Jinping Fan, Hung-Lin Fu, Yujie Gu +2
In nonadaptive combinatorial group testing (CGT), it is desirable to identify a small set of up to defectives from a large population of items with as few tests (i.e. large…
Algebraic Manipulation Detection Codes via Highly Nonlinear Functions
Minfeng Shao, Ying Miao
In this paper, we study the relationship between algebraic manipulation detection (AMD) codes and highly nonlinear functions. As applications, on one hand, a generic construction f…
On optimal weak algebraic manipulation detection codes and weighted external difference families
Minfeng Shao, Ying Miao
This paper provides a combinatorial characterization of weak algebraic manipulation detection (AMD) codes via a kind of generalized external difference families called bounded stan…