6 papers · 1 filter
A lower bound for random access in symmetric linear ensembles under optimal decoding
Daniella Bar-Lev, Ohad Elishco, Ryan Gabrys
We study the expected number of random linear observations required to recover a prescribed information symbol. For ensembles with uniformly random supports, independently sampled…
A Matroidal Framework for Random Access in Linear Codes
Daniella Bar-Lev, Hiram H. López, Gretchen L. Matthews +1
We study random access in linear codes when codeword symbols are sampled independently and uniformly with replacement. A code is recovery balanced if the expected number of samples…
A Hyperbolic Bound for File Retrieval in DNA-Based Data Storage
Constantinos Vasilios Argyris Vlachos, Daniella Bar-Lev
In DNA-based storage systems, data are retrieved by sequencing molecules sampled from a DNA pool. We study how the way coding redundancy is shared between files affects their expec…
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…
Coded Information Retrieval for Block-Structured DNA-Based Data Storage
Daniella Bar-Lev
We study the problem of coded information retrieval for block-structured data, motivated by DNA-based storage systems where a database is partitioned into multiple files that must…
A Single-Bit Redundancy Framework for Multi-Dimensional Parametric Constraints
Daniella Bar-Lev, Michael Shlizerman
Constrained coding plays a key role in optimizing performance and mitigating errors in applications such as storage and communication, where specific constraints on codewords are r…