Sequence Reconstruction Problem for Deletion Channels: A Complete Asymptotic Solution

Van Long Phuoc Pham, Keshav Goyal, Han Mao Kiah

Transmit a codeword $x$, that belongs to an $(\ell -1)$-deletion-correcting code of length $n$, over a $t$-deletion channel for some $1\le \ell \le t<n$. Levenshtein, in 2001, propos…