Entropy | |
Characterizing the Asymptotic Per-Symbol Redundancy of Memoryless Sources over Countable Alphabets in Terms of Single-Letter Marginals | |
Maryam Hosseini1 | |
[1] Department of Electrical Engineering, University of Hawaii at Manoa, Honolulu, HI 96822, |
|
关键词: universal compression; redundancy; large alphabets; tightness; redundancy-capacity theorem; | |
DOI : 10.3390/e16074168 | |
来源: mdpi | |
![]() |
【 摘 要 】
The minimum expected number of bits needed to describe a random variable is its entropy, assuming knowledge of the distribution of the random variable. On the other hand, universal compression describes data supposing that the underlying distribution is unknown, but that it belongs to a known set
【 授权许可】
CC BY
© 2014 by the authors; licensee MDPI, Basel, Switzerland
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO202003190023595ZK.pdf | 258KB | ![]() |