Note on the greedy parsing optimality for dictionary-based text compression

DOI10.1016/j.tcs.2014.01.013zbMath1282.68100arXiv1211.5108WikidataQ61677850 ScholiaQ61677850MaRDI QIDQ2437746

Maxime Crochemore, Filippo Mignosi, Alessio Langiu

Publication date: 13 March 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

data compression; text compression; optimal parsing; greedy parsing; \texttt{LZ77} algorithm; Lempel-Ziv factorisation

Mathematics Subject Classification ID

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

68U15: Computing methodologies for text processing; mathematical typography