A comment on 'A rate of convergence result for a universal D-semifaithful code'
暂无分享,去创建一个
In the above paper (see ibid., vol.39, no.3, p.813-20, 1993) Yu and Speed propose a universal pointwise D-semifaithful code whose expected compression ratio, for discrete memoryless sources, approaches the rate-distortion function at a rate O(n/sup -1/ log n). They also conjecture that this is the fastest achievable convergence rate for pointwise D-semifaithful codes. In this correspondence, we use a simple extension of Kraft's inequality and prove that this conjecture is true, at least for the Hamming distortion measure. >
[1] Zhen Zhang,et al. The redundancy of source coding with a fidelity criterion: 1. Known statistics , 1997, IEEE Trans. Inf. Theory.
[2] Toby Berger,et al. Rate distortion theory : a mathematical basis for data compression , 1971 .
[3] R. J. Pilc. The transmission distortion of a source as a function of the encoding block length , 1968 .
[4] Bin Yu,et al. A rate of convergence result for a universal D-semifaithful code , 1993, IEEE Trans. Inf. Theory.