A nearly tight memory-redundancy trade-off for one-pass compression
(0708.1877)Abstract
Let $s$ be a string of length $n$ over an alphabet of constant size $\sigma$ and let $c$ and $\epsilon$ be constants with (1 \geq c \geq 0) and (\epsilon > 0). Using (O (n)) time, (O (nc)) bits of memory and one pass we can always encode $s$ in (n Hk (s) + O (\sigmak n{1 - c + \epsilon})) bits for all integers (k \geq 0) simultaneously. On the other hand, even with unlimited time, using (O (nc)) bits of memory and one pass we cannot always encode $s$ in (O (n Hk (s) + \sigmak n{1 - c - \epsilon})) bits for, e.g., (k = \lceil (c + \epsilon / 2) \log_\sigma n \rceil).
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.