Establishes nonasymptotic achievability for the information bottleneck channel with fixed- and variable-length relaying and introduces a novel variable-length noisy lossy source coding bound.
Indirect lossy source coding with observed source reconstruction: Nonasymptotic bounds and second-order asymptotics
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
-
Nonasymptotic Oblivious Relaying and Variable-Length Noisy Lossy Source Coding
Establishes nonasymptotic achievability for the information bottleneck channel with fixed- and variable-length relaying and introduces a novel variable-length noisy lossy source coding bound.