In the context of the LZW dictionary construction, denoted as LZW-flexible parsing (LZW-FP), it is demonstrated that optimality of FP translates into considerable improvement over greedy parsing in practice. A new data structure based on Karp-Rabin fingerprints is introduced to efficiently implement FP.
|Number of pages||9|
|Journal||Proceedings of the Data Compression Conference|
|State||Published - 1999|
|Event||Proceedings of the 1999 Data Compression Conference, DCC-99 - Snowbird, UT, USA|
Duration: 29 Mar 1999 → 31 Mar 1999