Pith. sign in

Title resolution pending

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.IT 1

years

2026 1

verdicts

ACCEPT 1

representative citing papers

The Sample Complexity of Lossless Data Compression

cs.IT · 2026-01-10 · accept · novelty 6.0

For memoryless and Markov sources, the block length needed for lossless compression with bounded rate and excess-rate probability is characterized, up to constants, by the Rényi divergence of order 1/2 from the uniform distribution.

citing papers explorer

Showing 1 of 1 citing paper.

  • The Sample Complexity of Lossless Data Compression cs.IT · 2026-01-10 · accept · none · ref 47

    For memoryless and Markov sources, the block length needed for lossless compression with bounded rate and excess-rate probability is characterized, up to constants, by the Rényi divergence of order 1/2 from the uniform distribution.