65 citations · 308 across the 107 of their papers we have counts for
11 papers · 2 filters
Invertible Bloom Lookup Tables with Listing Guarantees
Avi Mizrahi, Daniella Bar-Lev, Eitan Yaakobi +1
The Invertible Bloom Lookup Table (IBLT) is a probabilistic concise data structure for set representation that supports a listing operation as the recovery of the elements in the r…
Generalized Unique Reconstruction from Substrings
Yonatan Yehezkeally, Daniella Bar-Lev, Sagi Marcovich +1
This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by…
Equivalence of Insertion/Deletion Correcting Codes for -dimensional Arrays
Evagoras Stylianou, Lorenz Welter, Rawad Bitar +2
We consider the problem of correcting insertion and deletion errors in the -dimensional space. This problem is well understood for vectors (one-dimensional space) and was recent…
On the Size of Balls and Anticodes of Small Diameter under the Fixed-Length Levenshtein Metric
Daniella Bar-Lev, Tuvi Etzion, Eitan Yaakobi
The rapid development of DNA storage has brought the deletion and insertion channel to the front line of research. When the number of deletions is equal to the number of insertions…
Covering Sequences for -Tuples
Sagi Marcovich, Tuvi Etzion, Eitan Yaakobi
de Bruijn sequences of order , i.e., sequences that contain each -tuple as a window exactly once, have found many diverse applications in information theory and most re…
Reconstruction from Substrings with Partial Overlap
Yonatan Yehezkeally, Daniella Bar-Lev, Sagi Marcovich +1
This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by…