8 papers
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…
An Additive Approximation Scheme for Generating Dyadic Codings for the Outputs of an LLM
Daniella Bar-Lev, Farzad Farnoud, Ryan Gabrys
We study the problem of approximating a discrete probability distribution, such as the next-token distribution of a large language model, by a dyadic distribution induced by a bina…
Efficient Synthesis for Two-Dimensional Strand Arrays with Row Constraints
Boaz Moav, Ryan Gabrys, Eitan Yaakobi
We study the theoretical problem of synthesizing multiple DNA strands under spatial constraints, motivated by large-scale DNA synthesis technologies. In this setting, strands are a…
Constructing Low-Redundancy Codes via Distributed Graph Coloring
Yuting Li, Ryan Gabrys, Farzad Farnoud
We present a general framework for constructing error-correcting codes using distributed graph coloring under the LOCAL model. Building on the correspondence between independent se…
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…