activity
20212025
most citedAdversarial Torn-paper Codes

19 citations · 40 across the 18 of their papers we have counts for

collaborators

20 papers

cs.DM2025

The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery

Shoham Shimon Berrebi, Eitan Yaakobi, Zohar Yakhini +1

We extend the Coupon Collector's Problem (CCP) and present a novel generalized model, referred as the k-LCCP problem, where one is interested in recovering a bipartite graph with a…

cs.IT2024

Conditional Entropies of k-Deletion/Insertion Channels

Shubhransh Singhvi, Omer Sabary, Daniella Bar-Lev +1

The channel output entropy of a transmitted sequence is the entropy of the possible channel outputs and similarly the channel input entropy of a received sequence is the entropy of…

cs.IT2024

Optimal Almost-Balanced Sequences

Daniella Bar-Lev, Adir Kobovich, Orian Leitersdorf +1

This paper presents a novel approach to address the constrained coding challenge of generating almost-balanced sequences. While strictly balanced sequences have been well studied i…

cs.IT2024

Representing Information on DNA using Patterns Induced by Enzymatic Labeling

Daniella Bar-Lev, Tuvi Etzion, Eitan Yaakobi +1

Enzymatic DNA labeling is a powerful tool with applications in biochemistry, molecular biology, biotechnology, medical science, and genomic research. This paper contributes to the…

cs.IT2024★ 2 cited

A Combinatorial Perspective on Random Access Efficiency for DNA Storage

Anina Gruica, Daniella Bar-Lev, Alberto Ravagnani +1

We investigate the fundamental limits of the recently proposed random access coverage depth problem for DNA data storage. Under this paradigm, it is assumed that the user informati…

cs.IT2023

Coding for IBLTs with Listing Guarantees

Daniella Bar-Lev, Avi Mizrahi, Tuvi Etzion +2

The Invertible Bloom Lookup Table (IBLT) is a probabilistic data structure for set representation, with applications in network and traffic monitoring. It is known for its ability…