Compression in the presence of shared data

DOI10.1016/S0020-0255(01)00099-8MaRDI QIDQ5944435zbMATH OpenOpenAlexFDO

Authors Michael Factor, Dafna Sheinwald

Publication date 10 October 2001

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0255(01)00099-8

zbMATH Keywords

compression algorithmsLempel-Ziv

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• Data compression with long repeated strings
• On the bit-complexity of Lempel-Ziv compression
• On the bit-complexity of Lempel-Ziv compression
• Improving dictionary based data compression by using previous knowledge and interaction
• Bicriteria data compression

Cites work

• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Efficient randomized pattern-matching algorithms
• On-line versus off-line computation in dynamic text compression
• Universal codeword sets and representations of the integers

Cited in

(8)

• On the distribution function of the complexity of finite sequences
• Sending compressed messages to a learned receiver on a bidirectional line.
• Direct merging of delta encoded files
• Improving dictionary based data compression by using previous knowledge and interaction
• scientific article; zbMATH DE number 6866309 (Why is no real title available?)
• LZ based compression benchmark on PE Files
• Interactive compression for product distributions
• Content-dependent chunking for differential compression, the local maximum approach

This page was built for publication: Compression in the presence of shared data

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