65 citations · 308 across the 107 of their papers we have counts for
143 papers · 1 filter
Sequential Random Sampling PIR with Multiple Colluding Servers in DNA-Based Data Storage
Chen Wang, Natalia Silberstein, Eitan Yaakobi
As DNA-based data storage evolves, protecting user privacy during data retrieval has become increasingly important. We study sequential random sampling DNA private information retr…
Optimal Codes for the Coverage Depth Problem and the Performance of Random Codes
Roee Gross, Yitzchak Grunbaum, Matteo Bertuzzo +2
DNA storage systems retrieve information by randomly sampling synthesized DNA strands, making the number of reads required for successful recovery a fundamental performance measure…
More on Codes for Combinatorial Composite DNA
Zuo Ye, Omer Sabary, Ryan Gabrys +2
In this paper, we focus on constructions of unique-decodable/list-decodable on the recently studied -composite-asymmetric error-correcting codes (-CAECCs). Let be…
Error characterization and error correction approaches in combinatorial DNA-based storage
Inbal Preuss, Omer Sabary, Ryan Gabrys +3
Data storage in DNA has recently emerged as a promising archival solution, offering space-efficient and long-lasting digital storage. Combinatorial DNA encoding enhances this poten…
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…
Sequence Reconstruction for Substitution Channel: New Sufficient Conditions and Algorithms
Chen Wang, Eitan Yaakobi, Yiwei Zhang
In the sequence reconstruction problem, a codeword $\x$ is transmitted through several identical channels where each channel produces a noisy read of $\x$, and the problem is to an…