6 papers
Serving Every Symbol: All-Symbol PIR and Batch Codes
Avital Boruchovsky, Anina Gruica, Jonathan Niemann +1
A -all-symbol PIR code and a -all-symbol batch code of dimension consist of servers storing linear combinations of information symbols with the following recovery…
Making it to First: The Random Access Problem in DNA Storage
Avital Boruchovsky, Ohad Elishco, Ryan Gabrys +3
In this paper, we study the Random Access Problem in DNA storage, which addresses the challenge of retrieving a specific information strand from a DNA-based storage system. In this…
On Nearly Perfect Covering Codes
Avital Boruchovsky, Tuvi Etzion, Ron M. Roth
Nearly perfect packing codes are those codes that meet the Johnson upper bound on the size of error-correcting codes. This bound is an improvement to the sphere-packing bound. A re…
Permutation Recovery Problem against Deletion Errors for DNA Data Storage
Shubhransh Singhvi, Charchit Gupta, Avital Boruchovsky +3
Owing to its immense storage density and durability, DNA has emerged as a promising storage medium. However, due to technological constraints, data can only be written onto many sh…
Data-Driven Bee Identification for DNA Strands
Shubhransh Singhvi, Avital Boruchovsky, Han Mao Kiah +1
We study a data-driven approach to the bee identification problem for DNA strands. The bee-identification problem, introduced by Tandon et al. (2019), requires one to identify …
DNA-Correcting Codes: End-to-end Correction in DNA Storage Systems
Avital Boruchovsky, Daniella Bar-Lev, Eitan Yaakobi
This paper introduces a new solution to DNA storage that integrates all three steps of retrieval, namely clustering, reconstruction, and error correction. DNA-correcting codes are…