Abstract
A new compression algorithm based on LZSS is presented. In this algorithm, both encoding and decoding are more involved and therefore much slower. The compression performance of the new method is also inferior to those of comparable LZ methods, but it is still superior to that of simple methods like Huffman coding, and even a method specially built for the compressed matching.
| Original language | English |
|---|---|
| Pages (from-to) | 400-409 |
| Number of pages | 10 |
| Journal | Proceedings of the Data Compression Conference |
| State | Published - 2000 |
| Externally published | Yes |
| Event | Data Compression Conference - DDC 2000 - Snowbird, UT, USA Duration: 28 Mar 2000 → 30 Mar 2000 |