3 papers
cs.IT2026
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…
cs.IT2025
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…
cs.IT2024
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…