Trace reconstruction with varying deletion probabilities
From MaRDI portal
Publication:5195105
DOI10.1137/1.9781611975062.6zbMath1430.68101arXiv1708.02216OpenAlexW2964199960MaRDI QIDQ5195105
Nina Holden, Yuval Peres, Lisa Hartung
Publication date: 18 September 2019
Published in: 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.02216
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (5)
Tree trace reconstruction using subtraces ⋮ Unnamed Item ⋮ Reconstructing trees from traces ⋮ The trace reconstruction problem for spider graphs ⋮ Information-Theoretic Foundations of DNA Data Storage
This page was built for publication: Trace reconstruction with varying deletion probabilities