Universality of Logarithmic Loss in Successive Refinement
We establish an universal property of logarithmic loss in the successive refinement problem. If the first decoder operates under logarithmic loss, we show that any discrete memoryless source is successively refinable under an arbitrary distortion criterion for the second decoder. Based on this resul...
Main Author: | Albert No |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-02-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/21/2/158 |
Similar Items
-
Universality of Logarithmic Loss in Fixed-Length Lossy Compression
by: Albert No
Published: (2019-06-01) -
On the Information Bottleneck Problems: Models, Connections, Applications and Information Theoretic Views
by: Abdellatif Zaidi, et al.
Published: (2020-01-01) -
The history and development of logarithms
by: Bennett, Meaghan Whitley
Published: (2010) -
Rate-Distortion Region of a Gray–Wyner Model with Side Information
by: Meryem Benammar, et al.
Published: (2017-12-01) -
On the refinements of the Jensen-Steffensen inequality
by: Khalid Sadia, et al.
Published: (2011-01-01)