Trace reconstruction with constant deletion probability and related results

We provide several new results for the trace reconstruction problem. In this setting, a binary string yields a collection of traces, where each trace is independently obtained by independently deleting each bit with a fixed probability Δ. Each trace therefore consists of a random subsequence of the original sequence. Given the traces, we wish to reconstruct… CONTINUE READING