Relations between greedy and bit-optimal LZ77 encodings

DOI10.4230/LIPICS.STACS.2018.46zbMATH Open1487.68101arXiv1707.09789MaRDI QIDQ3304145FDOQ3304145

Authors: Dmitry Kosolobov 

Publication date: 5 August 2020

Full work available at URL: https://arxiv.org/abs/1707.09789

Recommendations

• On the bit-complexity of Lempel-Ziv compression
• Note on the greedy parsing optimality for dictionary-based text compression
• Comparison of LZ77-type parsings
• On the bit-complexity of Lempel-Ziv compression
• A worst-case analysis of the LZ2 compression algorithm

zbMATH Keywords

Lempel-Zivbit optimal LZ77greedy LZ77LZ77 encoding

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Compression of individual sequences via variable-rate coding
• A universal algorithm for sequential data compression
• Online timestamped text indexing
• On compressing and indexing repetitive sequences
• Universal codeword sets and representations of the integers
• The Smallest Grammar Problem
• Note on the greedy parsing optimality for dictionary-based text compression
• Data compression via textual substitution
• Dictionary-symbolwise flexible parsing
• On the bit-complexity of Lempel-Ziv compression
• Range predecessor and Lempel-Ziv parsing
• LZ77-based self-indexing with faster pattern matching
• Affine m-ary gray codes
• Lempel-Ziv Compression in a Sliding Window
• Most Recent Match Queries in On-Line Suffix Trees

Cited In (5)

• Comparison of LZ77-type parsings
• LZ77 computation based on the run-length encoded BWT
• A separation between RLSLPs and LZ77
• Lempel-Ziv-like parsing in small space
• Note on the greedy parsing optimality for dictionary-based text compression

This page was built for publication: Relations between greedy and bit-optimal LZ77 encodings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304145)