Trace Reconstruction: Generalized and Parameterized
Leibniz International Proceedings in Informatics, 2019.
In the beautifully simple-to-state problem of trace reconstruction, the goal is to reconstruct an unknown binary string x given random "traces" of x where each trace is generated by deleting each coordinate of x independently with probability p < 1. The problem is well studied both when the unknown string is arbitrary and when it is chose...More
PPT (Upload PPT)