RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy

DOI10.1109/TIT.2018.2871452zbMath1432.68213OpenAlexW2890245531MaRDI QIDQ5223991

Carlos Ochoa, Gonzalo Navarro

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2018.2871452

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Measures of information, entropy (94A17)

Related Items (2)

Lempel-Ziv-like parsing in small space ⋮ Unnamed Item

This page was built for publication: RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy