Inequalities and algorithms for universal data compression

MaRDI QIDQ1389278zbMATH OpenFDO

Authors Jacob Ziv

Publication date 13 July 1998

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

conditional entropyconvexitydata-compression algorithmsfixed-to-variable uniquely decipherable codeshigher-order entropynonasymptotic uniform bounds

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 78498
• Compression and hadamard power inequalities
• Compressibility and uniform complexity
• Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics
• Toward an abstract theory of data compression
• P-complete problems in data compression
• Universal Compression of Memoryless Sources Over Unknown Alphabets
• Reconciling Data Compression and Kolmogorov Complexity
• Universal almost sure data compression

Cited in

(9)

• Unconditional bases and bit-level compression
• Compression and hadamard power inequalities
• Universal data compression and repetition times
• A universal algorithm for sequential data compression
• On fixed-database universal data compression with limited memory
• On sliding-window universal data compression with limited memory
• A universal prediction lemma and applications to universal data compression and prediction
• On the performance of recency-rank and block-sorting universal lossless data compression algorithms
• On the role of pattern matching in information theory

This page was built for publication: Inequalities and algorithms for universal data compression

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