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.
Variable-length sparse feedback codes for point-to-point, multiple access, and random access channels,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.