Comparison of LZ77-type parsings

DOI10.1016/j.ipl.2018.09.005zbMath1478.68081arXiv1708.03558OpenAlexW2963819515MaRDI QIDQ1621503

Dmitry Kosolobov, Arseny M. Shur

Publication date: 9 November 2018

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial problemslossless data compressionLZ77greedy parsingnon-overlapping phrases

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)

Uses Software

• LZ77
• r-index

Cites Work

• On compressing and indexing repetitive sequences
• Approximation of grammar-based compression via recompression
• Indexing text using the Ziv--Lempel trie
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• On the Bit-Complexity of Lempel--Ziv Compression
• Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
• The Smallest Grammar Problem
• Data compression via textual substitution
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• At the roots of dictionary compression: string attractors
• LZ77-Based Self-indexing with Faster Pattern Matching
• Affine m-ary gray codes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparison of LZ77-type parsings