5 papers · 1 filter
The Minimum Number of Samples in the Labeled Coupon Collector Problem
Andrew Tan, Daniella Bar-Lev, Ryan Gabrys +2
The Labeled Coupon Collector Problem (LCCP) is an extension of the classical Coupon Collector Problem (CCP) in which one must deduce an unknown mapping between coupons and labels b…
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
In large-scale array-based DNA synthesis, optical and chemical coupling between nearby sites can limit simultaneous activations. Motivated by this constraint, we study strands synt…