Distortion-Complexity and Rate-Distortion Function (Special Section on Information Theory and Its Applications)

概要

論文の詳細を見る
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.
社団法人電子情報通信学会の論文
1994-08-25