Sequence reconstruction problem for deletion channels: a complete asymptotic solution
Transmit a codeword x, that belongs to an (ℓ−1)-deletion-correcting code of length n, over a t-deletion channel for some 1≤ℓ≤t<n. Levenshtein (2001) [10], proposed the problem of determining N(n,ℓ,t)+1, the minimum number of distinct channel outputs required to uniquely reconstruct x. Prior to th...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/182329 |