Home >

news Help

Publication Information


Title
Japanese: 
English:New Non-Asymptotic Achievability and Converse Bounds for Fixed-Length Lossy Compression 
Author
Japanese: 松田哲直, 植松 友彦.  
English: Tetsunao Matsuta, Tomohiko Uyematsu.  
Language English 
Journal/Book name
Japanese: 
English:Proc. of the 37th Symposium on Information Theory and its Applications 
Volume, Number, Page         pp. 189-194
Published date Dec. 2, 2014 
Publisher
Japanese: 
English: 
Conference name
Japanese: 
English:37th Symposium on Information Theory and its Applications 
Conference site
Japanese: 
English: 
Abstract In this paper, we deal with the fixed-length lossy compression with the ε-fidelity criterion which is a kind of the distortion criterion such that the probability of exceeding a given distortion level is less than a given probability level. Then, we give an achievability bound and a converse bound of the minimum number of codewords with this criterion, where we introduce a new covering lemma to prove the achievability bound. We show that our converse bound is tighter than that of Kostina and Verdu. Furthermore, we show a numerical example which demonstrates that our achievability bound is tighter than that of Kostina and Verdu for short blocklengths.
Award 情報理論とその応用シンポジウム奨励賞

©2007 Tokyo Institute of Technology All rights reserved.