ملخص
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.
| اللغة الأصلية | الإنجليزيّة |
|---|---|
| الصفحات (من إلى) | 400-409 |
| عدد الصفحات | 10 |
| دورية | Proceedings of the Data Compression Conference |
| حالة النشر | نُشِر - 2000 |
| منشور خارجيًا | نعم |
| الحدث | Data Compression Conference - DDC 2000 - Snowbird, UT, USA المدة: ٢٨ مارس ٢٠٠٠ → ٣٠ مارس ٢٠٠٠ |