Gagie T., Manzini G. Space-conscious compression. In: MFCS '07 - Int. Symposium on Mathematical Foundations of Computer Science (Cesky Krumlov, 2007). Proceedings, vol. 4708 pp. 206 - 217. Springer, 2007. |

Abstract (English) |
Compression is most important when space is in short supply, so compression algorithms are often implemented in limited memory. Most analyses ignore memory constraints as an implementation detail, however, creating a gap between theory and practice. In this paper we consider the effect of memory limitations on compression algorithms. In the first part we assume the memory available is fixed and prove nearly tight upper and lower bounds on how much memory is needed to compress a string close to its k-th order entropy. In the second part we assume the memory available grows (slowly) as more and more characters are read. In this setting we show that the rate of growth of the available memory determines the speed at which the compression ratio approaches the entropy. In particular, we establish a relationship between the rate of growth of the sliding window in the LZ77 algorithm and its convergence rate. | |

Subject | compression Algorithm F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY |

1) Download Document PDF |

Open access Restricted Private