Daniella Bar-Lev

Orcid: 0000-0001-6766-1450

Affiliations:
  • Technion-Israel Institute of Technology, Haifa, Israel


According to our database1, Daniella Bar-Lev authored at least 21 papers between 2021 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Reducing Coverage Depth in DNA Storage: A Combinatorial Perspective on Random Access Efficiency.
CoRR, 2024

2023
Invertible Bloom Lookup Tables with Listing Guarantees.
Proc. ACM Meas. Anal. Comput. Syst., December, 2023

Adversarial Torn-Paper Codes.
IEEE Trans. Inf. Theory, October, 2023

Design of optimal labeling patterns for optical genome mapping via information theory.
Bioinform., October, 2023

Generalized Unique Reconstruction From Substrings.
IEEE Trans. Inf. Theory, September, 2023

On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric.
IEEE Trans. Inf. Theory, April, 2023

Universal Framework for Parametric Constrained Coding.
CoRR, 2023

On the Capacity of DNA Labeling.
Proceedings of the IEEE International Symposium on Information Theory, 2023

DNA-Correcting Codes: End-to-end Correction in DNA Storage Systems.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Coding for IBLTs with Listing Guarantees.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Reconstruction from Substrings with Partial Overlap.
CoRR, 2022

Codes for Constrained Periodicity.
CoRR, 2022

The Input and Output Entropies of the k-Deletion/Insertion Channel.
CoRR, 2022

On The Decoding Error Weight of One or Two Deletion Channels.
CoRR, 2022

The Input and Output Entropies of the k-Deletion/Insertion Channel with Small Radii.
Proceedings of the IEEE Information Theory Workshop, 2022

2021
Deep DNA Storage: Scalable and Robust DNA Storage via Coding Theory and Deep Learning.
CoRR, 2021

On the Size of Levenshtein Balls.
CoRR, 2021

The Intersection of Insertion and Deletion Balls.
Proceedings of the IEEE Information Theory Workshop, 2021

Decoding for Optimal Expected Normalized Distance over the t-Deletion Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2021

On Levenshtein Balls with Radius One.
Proceedings of the IEEE International Symposium on Information Theory, 2021


  Loading...