An optimization framework based on saddlepoint approximations jointly tunes decoding parameters for sparse VLSF codes and introduces a refined decoding rule that tightens achievability bounds.
Incremental redundancy with ACK/NACK feedback at a few optimal decoding times
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Derives finite-blocklength bounds on information density for VLSF codes over correlated fading channels that support stopping-time analysis and reliability guarantees.
citing papers explorer
-
Optimization of Sparse VLSF Codes for Short-Packet Transmission via Saddlepoint Methods
An optimization framework based on saddlepoint approximations jointly tunes decoding parameters for sparse VLSF codes and introduces a refined decoding rule that tightens achievability bounds.
-
VLSF Decoding with Reliability Guarantees over Correlated Noncoherent Fading Channels
Derives finite-blocklength bounds on information density for VLSF codes over correlated fading channels that support stopping-time analysis and reliability guarantees.