For (t,s)-sticky-insdel channels, a recursive formula gives the minimum number of distinct erroneous outputs needed to uniquely reconstruct the transmitted sequence, together with an efficient reconstruction algorithm.
Sequence reconst ruction problem for deletion channels: a complete asymptot ic solution
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sequence Reconstruction for Sticky Insertion/Deletion Channels
For (t,s)-sticky-insdel channels, a recursive formula gives the minimum number of distinct erroneous outputs needed to uniquely reconstruct the transmitted sequence, together with an efficient reconstruction algorithm.