Derives computable finite-length converse bounds for i.i.d. deletion and insertion channels via a reference output distribution, plus an exponential-time achievability algorithm.
Bounds on the capacity of random insertion and dele tion-additive noise channels
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
-
Simple Finite-Length Achievability and Converse Bounds for the Deletion Channel and the Insertion Channel
Derives computable finite-length converse bounds for i.i.d. deletion and insertion channels via a reference output distribution, plus an exponential-time achievability algorithm.