Compression estimates for a class of dictionary based compressors

MaRDI QIDQ3367201zbMATH OpenFDO

Authors C. Farinelli, Andrea Tolomelli, Mirko Degli Esposti

Publication date 23 January 2006

zbMATH Keywords

compression algorithmentropyinformation contentoptimality

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17)

Recommendations

• On the bit-complexity of Lempel-Ziv compression
• scientific article; zbMATH DE number 1305530
• On the bit-complexity of Lempel-Ziv compression
• On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
• Note on the greedy parsing optimality for dictionary-based text compression

Cited in

(5)

• Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
• Improving dictionary based data compression by using previous knowledge and interaction
• Compression of Multivariate Discrete Measures and Applications
• scientific article; zbMATH DE number 1432383 (Why is no real title available?)
• Entropy lower bounds for dictionary compression

This page was built for publication: Compression estimates for a class of dictionary based compressors

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