Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function

DOI10.1109/18.179376MaRDI QIDQ4034471zbMATH OpenOpenAlexFDO

Authors Enhui Yang, Shi-Yi Shen

Publication date 16 May 1993

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.179376

zbMATH Keywords

rate-distortion functionalmost sure data compressiondistortion Kolmogorov-Chaitin complexity

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• scientific article; zbMATH DE number 78498
• Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers
• Distortion-rate theory for individual sequences
• scientific article; zbMATH DE number 4033655
• scientific article; zbMATH DE number 3685392

Cited in

(5)

• Evaluating the Impact of Information Distortion on Normalized Compression Distance
• The rate-distortion dimension of sets and measures
• scientific article; zbMATH DE number 3685392 (Why is no real title available?)
• scientific article; zbMATH DE number 78498 (Why is no real title available?)
• Complexity distortion theory

This page was built for publication: Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4034471)