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.
Exponential error bounds for erasure, list, and decision feedback schemes
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
The paper analyzes a concatenated coding scheme for short-molecule DNA storage over symmetric sequencing channels, deriving an achievability bound on reliable information scaling and proving exponential error decay for random linear block codes under zero-undetected-error decoding.
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.
-
Concatenated Codes for Short-Molecule DNA Storage with Sequencing Channels of Positive Zero-Undetected-Error Capacity
The paper analyzes a concatenated coding scheme for short-molecule DNA storage over symmetric sequencing channels, deriving an achievability bound on reliable information scaling and proving exponential error decay for random linear block codes under zero-undetected-error decoding.