15 papers
The Generalized Random Access Problem for Linear Codes
Anina Gruica, Antonio Petrillo, Ferdinando Zullo
Random access is a central requirement in DNA-based storage systems: one would like to recover selected information symbols without sequencing the whole encoded object. A recent co…
Linear Code Conversion in the Merge Regime: General Bounds and Reed-Muller Constructions
Anina Gruica, Benjamin Jany, Stanislav Kruglik
Erasure codes are a core component of most existing large-scale distributed storage systems, ensuring reliability against node failures. Recent work has shown that adapting code pa…
Explicit and asymptotically good constructions of Algebraic Geometry codes in the sum-rank metric
Peter Beelen, Elena Berardini, Anina Gruica +1
Algebraic Geometry (AG) codes (i.e. linear codes from algebraic function fields) in the Hamming metric were proposed by Goppa in 1980 and have been intensively studied ever since.…
Convertible Codes for Data and Device Heterogeneity
Anina Gruica, Benjamin Jany, Stanislav Kruglik
Distributed storage systems must handle both data heterogeneity, arising from non-uniform access demands, and device heterogeneity, caused by time-varying node reliability. In this…
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…