collaborators

8 papers

cs.IT2026

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…

cs.DM2026

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…

cs.IT2026

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…

cs.IT2026

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…

cs.IR2026

Private Information Retrieval for Large-Scale DNA-Based Data Storage

Gökberk Erdoğan, Daniella Bar-Lev, Rawad Bitar +2

We investigate Private Information Retrieval (PIR) in the context of synthetic DNA-based data storage. While PIR is a well-studied primitive for digital databases, extending it to…

cs.IT2026

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…

cs.IT2026

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…

cs.IT2025

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…