6 papers
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…
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…
A point-variety incidence theorem over finite fields, and its applications
Xiangliang Kong, Itzhak Tamo
Incidence problems between geometric objects is a key area of focus in the field of discrete geometry. Among them, the study of incidence problems over finite fields have received…
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…
Combinatorial alphabet-dependent bounds for insdel codes
Xiangliang Kong, Itzhak Tamo, Hengjia Wei
Error-correcting codes resilient to synchronization errors such as insertions and deletions are known as insdel codes. Due to their important applications in DNA storage and comput…