For constant-composition random codebooks, the optimal second-order region, error exponent, and strong converse exponent of guessing-based decoding with abandonment are exactly determined by a single bottleneck quantity: the minimum (or maximum) of a channel coding term and an abandonment term.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment
For constant-composition random codebooks, the optimal second-order region, error exponent, and strong converse exponent of guessing-based decoding with abandonment are exactly determined by a single bottleneck quantity: the minimum (or maximum) of a channel coding term and an abandonment term.