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.
Entropy coding of unordered data structures
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.