arXiv · 2009.03296
New upper bounds for trace reconstruction
Abstract
We show that any $n$-bit string can be recovered with high probability from $\exp(\widetilde{O}(n^{1/5}))$ independent random subsequences.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Zachary Chase. 2022-01-11. New upper bounds for trace reconstruction. https://arxiv.org/abs/2009.03296
Cite the original work for its findings. Save a collection to share your selection of sources.