scientific article; zbMATH DE number 78498

MaRDI QIDQ4016320zbMATH OpenFDO

Authors Enhui Yang

Publication date 14 December 1992

zbMATH Keywords

abstract source alphabetsbounded distortion variable rate codeChaitin complexitydata compressionoperational rate distortion functionreproducing alphabets

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Formal languages and automata (68Q45) Information theory (general) (94A15)

Recommendations

• Universal almost sure data compression
• Publication:3199318
• Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function
• Problems of robustness for universal coding schemes
• A universal algorithm for sequential data compression

Cited in

(7)

• Inequalities and algorithms for universal data compression
• Unconditional bases and bit-level compression
• scientific article; zbMATH DE number 5968919 (Why is no real title available?)
• scientific article; zbMATH DE number 4174823 (Why is no real title available?)
• Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function
• Toward an abstract theory of data compression
• Universal almost sure data compression

This page was built for publication:

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