DocumentCode
314023
Title
Complexity distortion theory
Author
Sow, Daby ; Eleftheriadis, Alexandros
Author_Institution
Dept. of Electr. Eng., Columbia Univ., New York, NY, USA
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
188
Abstract
We investigate the efficiency of lossy algorithmic representations of information and show that “complexity distortion” is asymptotically equivalent to rate distortion for stationary ergodic sources
Keywords
computational complexity; rate distortion theory; source coding; complexity distortion theory; information theory; lossy algorithmic representations; rate distortion; stationary ergodic sources; Additives; Decoding; Distortion measurement; Entropy; Fractals; Quantization; Rate-distortion; Signal representations; Turing machines; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613103
Filename
613103
Link To Document