On the suitability of suffix arrays for lempel-ziv data compression
Lossless compression algorithms of the Lempel-Ziv (LZ) family are widely used nowadays. Regarding time and memory requirements, LZ encoding is much more demanding than decoding. In order to speed up the encoding process, efficient data structures, like suffix trees, have been used. In this paper, we...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.21/568 |
| Country: | Portugal |
| Oai: | oai:repositorio.ipl.pt:10400.21/568 |