Prague Stringology Conference 2025
Igor O. Zavadskyi and Maksym Kovalchuk
Best Practices in Adaptive Encoding
| Abstract: |
| We discuss and experimentally evaluate a range of classical and recently developed adaptive data compression algorithms. Key features of each method are highlighted, and their effectiveness in real-world data compression scenarios is assessed. By combining these techniques, we construct a family of simple adaptive encoding methods that achieve an excellent space-time trade-off, particularly for text with small alphabets such as ASCII. Compared to classical Vitter's algorithm, our method is several times faster while maintaining a similar compression ratio. Compared to Gagie's worst-case optimal solution, our algorithm generates compressed files that are about 10 % smaller, while also delivering faster encoding and decoding speeds. |
| Download paper: |  |
 |
 |
| PostScript | BibTeX reference |
| Download presentation: |  |