TY - GEN
T1 - New Results on Variable-Length Lossy Compression Allowing Positive Overflow and Excess Distortion Probabilities
AU - Saito, Shota
AU - Yagi, Hideki
AU - Matsushima, Toshiyasu
N1 - Funding Information:
ACKNOWLEDGMENT This work was supported in part by JSPS KAKENHI Grant Numbers JP16K00195, JP16K00417, JP16K06340, JP17K00316, and JP17K06446.
Publisher Copyright:
© 2018 IEICE.
PY - 2018/7/2
Y1 - 2018/7/2
N2 - This paper shows some new results for the problem of variable-length lossy source coding. We deal with the case where both the excess distortion probability and the overflow probability of codeword lengths are less than or equal to positive constants. Our previous study for the problem of variable-length (noiseless) lossy source coding has derived the general formula of the infimum of the thresholds on the overflow probability by using the quantity based on the smooth max entropy. This study extends this result in two directions. First, we derive the single-letter characterization of the infimum of the thresholds on the overflow probability for stationary memoryless sources. Second, for the problem of variable-length noisy lossy source coding, also known as the problem of remote lossy source coding, we establish the general nonasymptotic formula on the converse bound by using the new quantity based on the smooth max entropy.
AB - This paper shows some new results for the problem of variable-length lossy source coding. We deal with the case where both the excess distortion probability and the overflow probability of codeword lengths are less than or equal to positive constants. Our previous study for the problem of variable-length (noiseless) lossy source coding has derived the general formula of the infimum of the thresholds on the overflow probability by using the quantity based on the smooth max entropy. This study extends this result in two directions. First, we derive the single-letter characterization of the infimum of the thresholds on the overflow probability for stationary memoryless sources. Second, for the problem of variable-length noisy lossy source coding, also known as the problem of remote lossy source coding, we establish the general nonasymptotic formula on the converse bound by using the new quantity based on the smooth max entropy.
UR - http://www.scopus.com/inward/record.url?scp=85063896509&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85063896509&partnerID=8YFLogxK
U2 - 10.23919/ISITA.2018.8664222
DO - 10.23919/ISITA.2018.8664222
M3 - Conference contribution
AN - SCOPUS:85063896509
T3 - Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018
SP - 359
EP - 363
BT - Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 15th International Symposium on Information Theory and Its Applications, ISITA 2018
Y2 - 28 October 2018 through 31 October 2018
ER -