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.
Channel simulation: Theory and applications to lossy compression and differential privacy
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2verdicts
UNVERDICTED 2representative citing papers
A game-theoretic information theory with dynamic hedging and nonconvex downward-closed cones subsumes probabilistic channel coding theorems and adversarial settings.
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.
-
A Non-Probabilistic Game-Theoretic Information Theory Which Subsumes Probabilistic Channel Coding
A game-theoretic information theory with dynamic hedging and nonconvex downward-closed cones subsumes probabilistic channel coding theorems and adversarial settings.