17 citations · 37 across the 17 of their papers we have counts for
Showing math.PRShow all
3 papers · 1 filter
math.PR2021★ 1 cited
Approximate trace reconstruction of random strings from a constant number of traces
Zachary Chase, Yuval Peres
In the trace reconstruction problem, the goal is to reconstruct an unknown string of length from multiple traces obtained by passing through the deletion channel. In th…
math.PR2020★ 10 cited
New upper bounds for trace reconstruction
Zachary Chase
We show that any -bit string can be recovered with high probability from independent random subsequences.
math.PR2019★ 2 cited
New Lower Bounds for Trace Reconstruction
Zachary Chase
We improve the lower bound on worst case trace reconstruction from to . As a consequence, we…