The paper introduces a general optimization framework that recovers Rényi and Shannon entropies as optimal solutions for guessing, source coding, and task partitioning problems.
Generalization of Huffman coding to minim ize the probability of buffer overflow (corresp.),
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Unified Framework for Problems on Guessing, Source Coding and Task Partitioning
The paper introduces a general optimization framework that recovers Rényi and Shannon entropies as optimal solutions for guessing, source coding, and task partitioning problems.