Establishes exact error and strong converse exponents for IB source coding via matching bounds and links it operationally to the Wyner-Ahlswede-Körner problem.
Information transmission with additional noise,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2verdicts
UNVERDICTED 2representative citing papers
The authors prove supply-demand converses and a receiver-internal compute min-cut bound for reliable remote inference under unreliable communication and computation, showing that certain losses are closure-dependent rather than universal.
citing papers explorer
-
Exponential Error Bounds for Information Bottleneck Source Coding Problems
Establishes exact error and strong converse exponents for IB source coding via matching bounds and links it operationally to the Wyner-Ahlswede-Körner problem.
-
Reliable Remote Inference from Unreliable Components: Joint Communication and Computation Limits
The authors prove supply-demand converses and a receiver-internal compute min-cut bound for reliable remote inference under unreliable communication and computation, showing that certain losses are closure-dependent rather than universal.