The deletion-insertion channel takes as input a bit string x ∈ {0, 1} n , and outputs a string where bits have been deleted and inserted independently at random. The trace reconstruction problem is to recover x from many independent outputs (called "traces") of the deletion-insertion channel applied to x. We show that if x is chosen uniformly at random, then exp(O(log 1/3 n)) traces suffice to reconstruct x with high probability. The earlier upper bounds were exp(O(log 1/2 n)) for the deletion channel with deletion probability less than 1/2, and exp(O(n 1/3 )) for the general case. A key ingredient in our proof is a two-step alignment procedure where we estimate the location in each trace corresponding to a given bit of x. The alignment is done by viewing the strings as random walks, and comparing the increments in the walk associated with the input string and the trace, respectively.
The state-of-the-art result, proved by Holden, Pemantle, and Peres REF , states that exp(log 1/3 n) traces suffice to reconstruct a random n-bit string under arbitrary constant deletion probability.
Subpolynomial trace reconstruction for random strings and arbitrary deletion probability
ArXiv
ArXiv
Computer Science Mathematics