Compression in the presence of shared data

DOI10.1016/S0020-0255(01)00099-8zbMath1031.68537OpenAlexW1996784453MaRDI QIDQ5944435

Dafna Sheinwald, Michael Factor

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

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

Related Items (3)

On the distribution function of the complexity of finite sequences ⋮ Direct merging of delta encoded files ⋮ Sending compressed messages to a learned receiver on a bidirectional line.

Cites Work

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

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