Comparison of LZ77-type parsings

DOI10.1016/j.ipl.2018.09.005zbMath1478.68081arXiv1708.03558MaRDI 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 problems; lossless data compression; LZ77; greedy parsing; non-overlapping phrases

Mathematics Subject Classification ID

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

68Q42: Grammars and rewriting systems

68W32: Algorithms on strings

Uses Software

• LZ77
• r-index