no code implementations • 12 Dec 2020 • Sami Davies, Miklos Z. Racz, Cyrus Rashtchian, Benjamin G. Schiffer
In the usual trace reconstruction problem, the goal is to exactly reconstruct an unknown string of length $n$ after it passes through a deletion channel many times independently, producing a set of traces (i. e., random subsequences of the string).
