DISTORTION-COMPLEXITY AND RATE-DISTORTION FUNCTION

被引:0
|
作者
MURAMATSU, J
KANAYA, F
机构
关键词
COMPLEXITY; DISTORTION-COMPLEXITY; RATE-DISTORTION FUNCTION; UNIVERSAL CODE;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We define the complexity and the distortion-complexity of an individual finite length string from a finite set. Assuming that the string is produced by a stationary ergodic source, we prove that the distortion-complexity per source letter and its expectation approximate arbitrarily close the rate-distortion function of this source as the length of the string grows. Furthermore, we apply this property to construct a universal data compression scheme with distortion.
引用
收藏
页码:1224 / 1229
页数:6
相关论文
共 50 条