Sequence reconstruction problem for deletion channels: a complete asymptotic solution

• المؤلفون الرئيسيون: Pham, Van Long Phuoc, Goyal, Keshav, Kiah, Han Mao
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2025
• الموضوعات: Mathematical Sciences; Sequence reconstruction problem; Deletion-correcting codes
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/182329
• المؤسسة: Nanyang Technological University

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...