Application of Lempel-Ziv factorization to the approximation of grammar-based compression

DOI10.1007/3-540-45452-7_3MaRDI QIDQ4737684zbMATH OpenFDO

Authors Wojciech Rytter

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2373/23730020.htm

zbMATH Keywords

AVL-grammarAVL-treeLZ-compressionminimal grammar

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)

Recommendations

• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• scientific article; zbMATH DE number 2119662
• Approximation of grammar-based compression via recompression
• Approximation of Grammar-Based Compression via Recompression
• The Smallest Grammar Problem

Cited in

(8)

• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• One-dimensional staged self-assembly
• A fully linear-time approximation algorithm for grammar-based compression
• One-dimensional staged self-assembly
• On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
• Approximation of Grammar-Based Compression via Recompression
• Lyndon factorization of grammar compressed texts revisited
• Constant-delay enumeration for SLP-compressed documents

This page was built for publication: Application of Lempel-Ziv factorization to the approximation of grammar-based compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737684)