New upper bounds for trace reconstruction
Probability
2022-01-12 v3 Information Theory
Combinatorics
math.IT
Authors:
Zachary Chase
Abstract
We show that any n-bit string can be recovered with high probability from exp(O(n1/5)) independent random subsequences.
Cite
@article{arxiv.2009.03296,
title = {New upper bounds for trace reconstruction},
author = {Zachary Chase},
journal= {arXiv preprint arXiv:2009.03296},
year = {2022}
}
Comments
16 pages
Related papers
View all related →
Probability · Mathematics
Trace reconstruction with $\exp( O( n^{1/3} ) )$ samples
Fedor Nazarov, Yuval Peres
2016-12-13
Probability · Mathematics
Lower bounds for trace reconstruction
Nina Holden, Russell Lyons
2019-06-10
Data Structures and Algorithms · Computer Science
Circular Trace Reconstruction
Shyam Narayanan, Michael Ren
2020-12-15
Data Structures and Algorithms · Computer Science
Near-Optimal Trace Reconstruction for Mildly Separated Strings
Anders Aamand, Allen Liu, Shyam Narayanan
2024-12-02
Probability · Mathematics
Trace reconstruction with varying deletion probabilities
Lisa Hartung, Nina Holden, Yuval Peres
2017-08-08
Information Theory · Computer Science
Substring Density Estimation from Traces
Kayvon Mazooji, Ilan Shomorony
2022-10-21
Data Structures and Algorithms · Computer Science
Trace Reconstruction: Generalized and Parameterized
Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor, Soumyabrata Pal
2021-03-16
Probability · Mathematics
Subpolynomial trace reconstruction for random strings and arbitrary deletion probability
Nina Holden, Robin Pemantle, Yuval Peres, Alex Zhai
2020-04-28
Information Theory · Computer Science
Average-Case to (shifted) Worst-Case Reduction for the Trace Reconstruction Problem
Ittai Rubinstein
2022-08-15
Data Structures and Algorithms · Computer Science
Average-case reconstruction for the deletion channel: subpolynomially many traces suffice
Yuval Peres, Alex Zhai
2017-08-03
Information Theory · Computer Science
Coded trace reconstruction in a constant number of traces
Joshua Brakensiek, Ray Li, Bruce Spang
2020-09-15
Data Structures and Algorithms · Computer Science
A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities
Joey Rivkin, Gregory Valiant, Paul Valiant
2024-12-03
Data Structures and Algorithms · Computer Science
New Bounds for Circular Trace Reconstruction
Arnav Burudgunte, Paul Valiant, Hongao Wang
2025-12-03
Combinatorics · Mathematics
Trace reconstruction of matrices and hypermatrices
Wenjie Zhong, Xiande Zhang
2026-03-11
Computational Complexity · Computer Science
Optimal mean-based algorithms for trace reconstruction
Anindya De, Ryan O'Donnell, Rocco Servedio
2016-12-12
Data Structures and Algorithms · Computer Science
Approximate Trace Reconstruction from a Single Trace
Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio +1
2022-11-08
Information Theory · Computer Science
Trace Reconstruction of First-Order Reed-Muller Codewords Using Run Statistics
Shiv Pratap Singh Rathore, Navin Kashyap
2025-11-06
Information Theory · Computer Science
Trace Reconstruction with Bounded Edit Distance
Jin Sima, Jehoshua Bruck
2021-04-15
Data Structures and Algorithms · Computer Science
Approximate Trace Reconstruction via Median String (in Average-Case)
Diptarka Chakraborty, Debarati Das, Robert Krauthgamer
2021-07-21
Data Structures and Algorithms · Computer Science
Polynomial-time trace reconstruction in the low deletion rate regime
Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio +1
2020-12-09
Data Structures and Algorithms · Computer Science
Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces
Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio +1
2021-08-26
Probability · Mathematics
Approximate trace reconstruction of random strings from a constant number of traces
Zachary Chase, Yuval Peres
2021-07-15
Data Structures and Algorithms · Computer Science
Polynomial-time trace reconstruction in the smoothed complexity model
Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio +1
2020-08-31
Discrete Mathematics · Computer Science
String Reconstruction from Substring Compositions
Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky +1
2014-03-12
Information Theory · Computer Science
On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction
Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan +1
2024-01-30