5 citations · 12 across the 7 of their papers we have counts for
8 papers · 1 filter
Error Correction for DNA Storage
Jin Sima, Netanel Raviv, Moshe Schwartz +1
DNA-based storage is an emerging storage technology that provides high information density and long duration. Due to the physical constraints in the reading and writing processes,…
Break-Resilient Codes
Canran Wang, Jin Sima, Netanel Raviv
We investigate the problem of encoding data into an -break-resilient code (-BRC), i.e., a collections of sequences of length~ from which the original data can be…
Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions
Jin Sima, Netanel Raviv, Jehoshua Bruck
Encoding data as a set of unordered strings is receiving great attention as it captures one of the basic features of DNA storage systems. However, the challenge of constructing opt…
Non-binary Codes for Correcting a Burst of at Most t Deletions
Shuche Wang, Yuanyuan Tang, Jin Sima +2
The problem of correcting deletions has received significant attention, partly because of the prevalence of these errors in DNA data storage. In this paper, we study the problem of…
Trace Reconstruction with Bounded Edit Distance
Jin Sima, Jehoshua Bruck
The trace reconstruction problem studies the number of noisy samples needed to recover an unknown string with high probability, where the samples are i…
Optimal -Deletion Correcting Codes
Jin Sima, Jehoshua Bruck
Levenshtein introduced the problem of constructing -deletion correcting codes in 1966, proved that the optimal redundancy of those codes is , and proposed an optimal…