5 papers · 1 filter
The Coverage Depth Problem in Distributed DNA Data Storage
Xiangliang Kong, Ohad Elishco, Chen Wang +1
Random sampling in DNA sequencing produces repeated reads, increasing retrieval latency and sequencing cost. We study the coverage-depth problem for full-message recovery in distri…
Bounds on Multiple -Burst Deletion-Correcting Codes
Chen Wang, Xiangliang Kong, Eitan Yaakobi +1
Motivated by their applications in DNA-based storage systems, codes capable of correcting consecutive deletions have attracted significant attention. An important class of such cod…
New Bounds and Constructions for Variable Packet-Error Coding
Xiangliang Kong, Xin Wang, Ron M. Roth +1
In this paper, we consider the problem of variable packet-error coding, which emerges in network communication scenarios where a source transmits information to a destination throu…
New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage
Xiangliang Kong, Shreya Meel, Thomas Jacob Maranzatto +2
In this paper, we study the problem of private information retrieval (PIR) in both graph-based and multigraph-based replication systems, where each file is stored on exactly two se…
Private Information Retrieval on Multigraph-Based Replicated Storage
Shreya Meel, Xiangliang Kong, Thomas Jacob Maranzatto +2
We consider the private information retrieval (PIR) problem for a multigraph-based replication system, where each set of files is stored on two of the servers according to an u…