Rejection sampling achieves the functional information lower bound for relative entropy coding within log e bits, providing the tightest known one-shot bounds.
Public vs private coin in bounded-round information,
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
BBRS achieves the same sub-logarithmic asymptotic redundancy for relative entropy coding on singular channels as Sriramu and Wagner's method, but with simpler analysis, improved constants, and practical implementability via standard techniques.
citing papers explorer
-
Rejection Sampling is Optimal for Relative Entropy Coding
Rejection sampling achieves the functional information lower bound for relative entropy coding within log e bits, providing the tightest known one-shot bounds.
-
Singular Relative Entropy Coding with Bits-Back Rejection Sampling
BBRS achieves the same sub-logarithmic asymptotic redundancy for relative entropy coding on singular channels as Sriramu and Wagner's method, but with simpler analysis, improved constants, and practical implementability via standard techniques.