On the Approximation Ratio of Ordered Parsings

Shannon's entropy is a clear lower bound for statistical compression. The situation is not so well understood for dictionary-based compression. A plausible lower bound is \boldsymbol {b} , the least number of phrases of a general bidirectional parse of a text, where phrases can be copied from...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2021-02, Vol.67 (2), p.1008-1026
Hauptverfasser:	Navarro, Gonzalo, Ochoa, Carlos, Prezza, Nicola
Format:	Artikel
Sprache:	eng
Schlagworte:	Approximation Burrows-Wheeler transform collage systems Compressibility context-free grammars Entropy Entropy (Information theory) Genomics Grammar Grammars greedy parsing Internet Lempel-Ziv complexity lexicographic parsing Lower bounds Mathematical analysis optimal bidirectional parsing Optimization ordered parsing Probabilistic logic repetitive sequences run-length compressed Burrows-Wheeler transform Transforms Upper bound Upper bounds
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!